Thirty years of Polynomial System Solving, and now?
Author:
- Daniel LazardDLDaniel Lazard
- 1 March 2009
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 44 (3) , 222-231
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Using Computer Algebra to Certify the Global Convergence of a Numerical Optimization ProcessMathematics in Computer Science, 2007
- The voronoi diagram of three lines2007
- Injectivity of real rational mappings: the case of a mixture of two Gaussian lawsMathematics and Computers in Simulation, 2004
- A new efficient algorithm for computing Gröbner bases (F4)Journal of Pure and Applied Algebra, 1999
- Efficient Computation of Zero-dimensional Gröbner Bases by Change of OrderingJournal of Symbolic Computation, 1993
- A Generalized Euclidean Algorithm for Computing Triangular Representations of Algebraic VarietiesJournal of Symbolic Computation, 1993
- Solving zero-dimensional algebraic systemsJournal of Symbolic Computation, 1992
- How we proved that there are exactly 924 cyclic 7-roots1991
- Resolution des systemes d'equations algebriquesTheoretical Computer Science, 1981
- Algèbre linéaire sur $K[X_1,\dots,X_n]$ et éliminationBulletin de la Société Mathématiques de France, 1977