default search action
Journal of Symbolic Computation, Volume 74
Volume 74, May - June 2016
- Federico Galetto
:
Propagating weights of tori along free resolutions. 1-45 - Dima Grigoriev, Gleb A. Koshevoy
Complexity of tropical Schur polynomials. 46-54 - Gavin Harrison
Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation. 55-69 - C. T. Lee, C. C. Lee:
Symbolic computation on a second-order KdV equation. 70-95 - Elizaveta Frenkel, Andrey Nikolaev, Alexander Ushakov
Knapsack problems in products of groups. 96-108 - Anders Lundman:
Local positivity of line bundles on smooth toric varieties and Cayley polytopes. 109-124 - V. E. Adler:
Integrability test for evolutionary lattice equations of higher order. 125-139 - Rida T. Farouki, Graziano Gentili
Solution of a quadratic quaternion equation with mixed coefficients. 140-151 - Susan Margulies, Jason Morton:
Polynomial-time solvable #CSP problems via algebraic models and Pfaffian circuits. 152-180 - Victor Y. Pan, Elias P. Tsigaridas:
Nearly optimal refinement of real roots of a univariate polynomial. 181-204 - Didier Henrion
Real root finding for determinants of linear matrices. 205-238 - Jonathan D. Hauenstein, Alan C. Liddell Jr.:
Certified predictor-corrector tracking for Newton homotopies. 239-254 - Marek Kosta, Thomas Sturm
Better answers to real questions. 255-275 - Johannes Rauh
Lifting Markov bases and higher codimension toric fiber products. 276-307 - Burçin Eröcal, Oleksandr Motsak, Frank-Olaf Schreyer, Andreas Steenpaß:
Refined algorithms to compute syzygies. 308-327 - Wojciech Nawalaniec
Algorithms for computing symbolic representations of basic e-sums and their application to composites. 328-345 - Magdaleen S. Marais, Andreas Steenpaß:
The classification of real singularities using Singular. Part II: The structure of the equivalence classes of the unimodal singularities. 346-366 - Jan Vrsek, Miroslav Lávicka
Recognizing implicitly given rational canal surfaces. 367-377 - Marta Abril Bucero, Bernard Mourrain:
Border basis relaxation for polynomial optimization. 378-399 - Charles Ching-An Cheng, Takis Sakkalis:
On new types of rational rotation-minimizing frame space curves. 400-407 - A. Odabas, E. Ö. Uslu, E. Ilgaz:
Isoclinism of crossed modules. 408-424 - Valérie Berthé, Loïck Lhote, Brigitte Vallée:
Probabilistic analyses of the plain multiple gcd algorithm. 425-474 - Abdallah Assi, Pedro A. García-Sánchez
Algorithms for curves with one place at infinity. 475-492 - Nicolás Botbol, Alicia Dickenstein
Implicitization of rational hypersurfaces via linear syzygies: A practical overview. 493-512 - Winfried Bruns, Bogdan Ichim
The power of pyramid decomposition in Normaliz. 513-536 - Ainhoa Aparicio-Monforte, Thomas Dreyfus, Jacques-Arthur Weil:
Liouville integrability: An effective Morales-Ramis-Simó theorem. 537-560 - J. William Hoffman, Zhibin Liang, Yukiko Sakai, Hao Hao Wang:
Genus 3 curves whose Jacobians have endomorphisms by. 561-577 - Hara Charalambous, Apostolos Thoma, Marius Vladoiu:
Binomial fibers and indispensable binomials. 578-591 - Aaron Herman, Hoon Hong:
Quality of positive root bounds. 592-602 - Paul Görlach
Deciding positivity of multisymmetric polynomials. 603-616 - Shaoshi Chen, Manuel Kauers, Michael F. Singer:
Desingularization of Ore operators. 617-626 - Alexandru Dimca
Syzygies of Jacobian ideals and weighted homogeneous singularities. 627-634 - Giovanni Staglianò:
Examples of special quadratic birational transformations into complete intersections of quadrics. 635-649 - Christopher J. Hillar, Abraham Martín del Campo:
Corrigendum to "Finiteness theorems and algorithms for permutation invariant chains of Laurent lattice ideals" [J. Symb. Comput. 50(March 2013) 314-334]. 650-652
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-13 19:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: