A Gröbner free alternative for polynomial system solving (2001)

by Marc Giusti , Grégoire Lecerf , Bruno Salvy
Venue:Journal of Complexity
Citations:80 - 16 self

Documents Related by Co-Citation

62 When polynomial equation systems can be "solved" fast? – M. Giusti, J. Heintz, J. E. Morais, L. M. Pardo - 1995
62 LOWER BOUNDS FOR DIOPHANTINE APPROXIMATIONS – M. Giusti, J. Heintz, K. Hägele, J. E. Morais, L. M. Pardo, J. L. Montaña - 1996
58 Straight-line programs in geometric elimination theory – M. Giusti, J. Heintz, J. E. Morais, J. Morgenstern L. M. Pardo - 1998
100 Solving zero-dimensional systems through the rational univariate representation. Applicable Algebra – F Rouillier - 1999
58 Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers – Grégoire Lecerf - 2000
41 On the complexity of semialgebraic sets – J Heintz, M-F Roy, P Solernó - 1989
65 Grundzüge einer arithmetischen Theorie der algebraischen Grössen – Leopold Kronecker - 1882
193 Algebraic Complexity Theory – P Bürgisser, M Clausen, M A Shokrollahi - 1997
54 Zeros, Multiplicities and Idempotents for Zerodimensional Systems – Mariemi Alonso, Eberhard Becker, Marie-Francoise Roy, Thorsten Wörmann
52 La Détermination Des Points Isolés Et De La Dimension D'une Variété Algébrique Peut Se Faire En Temps Polynomial – Marc Giusti, Joos Heintz, Contre Le Conicet - 1991
12 Probabilistic Algorithms for Geometric Elimination – Guillermo Matera - 1999
58 A computational method for Diophantine approximation – T Krick, L M Pardo
23 On the Time-Space Complexity of Geometric Elimination Procedures – Joos Heintz, Guillermo Matera, Ariel Waissbein - 1999
23 Finding at least one point in each connected component of a . . . – F. Rouillier, M.-F. Roy, M. Safey El Din
201 On the Combinatorial and Algebraic Complexity of Quantifier Elimination – Saugata Basu, Richard Pollack, Marie-Francoise Roy - 1996
29 Polar varieties and efficient real elimination – B. Bank, M. Giusti, J. Heintz, G. M. Mbakop - 2001
437 zur Gathen and – J von - 1999
29 Testing polynomials which are easy to compute – J Heintz, C-P Schnorr - 1982
26 Subexponential time solving systems of algebraic equations – A L Chistov, D Y Grigoriev - 1983