A Gröbner free alternative for polynomial system solving

Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation

Solving projective complete intersection faster

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation

A probabilistic algorithm to test local algebraic observability in polynomial time

Proceedings of the 2001 international symposium on Symbolic and algebraic computation

A probabilistic algorithm to test local algebraic observability in polynomial time

Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001

Solving the Birkhoff Interpolation Problem via the Critical Point Method: An Experimental Study

ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry

Functional programming concepts and straight-line programs in computer algebra

Mathematics and Computers in Simulation

Systems of rational polynomial equations have polynomial size approximate zeros on the average

Journal of Complexity

The differential Hilbert function of a differential rational mapping can be computed in polynomial time

Proceedings of the 2002 international symposium on Symbolic and algebraic computation

Degree bounds and lifting techniques for triangular sets

Proceedings of the 2002 international symposium on Symbolic and algebraic computation

Polar varieties and computation of one point in each connected component of a smooth real algebraic set

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation

Cited References

Computer algebra handbook

Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers

Journal of Complexity

Complexity results for triangular sets

Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)

Numerical algebraic geometry and symbolic computation

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation

Sharp estimates for triangular sets

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation

Polynomial equation solving by lifting procedures for ramified fibers

Theoretical Computer Science - Algebraic and numerical algorithm

Deformation techniques to solve generalised Pham systems

Theoretical Computer Science - Algebraic and numerical algorithm

On solving univariate sparse polynomials in logarithmic time

Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops

Lifting techniques for triangular decompositions

Proceedings of the 2005 international symposium on Symbolic and algebraic computation

Generalized normal forms and polynomial system solving

Proceedings of the 2005 international symposium on Symbolic and algebraic computation

Generalized polar varieties: geometry and algorithms

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage

Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage

On the complexity of the resolvent representation of some prime differential ideals

Journal of Complexity

A real-time and exact implementation of the predicates for the Voronoi diagram of parametric ellipses

Proceedings of the 2007 ACM symposium on Solid and physical modeling

Change of order for regular chains in positive dimension

Theoretical Computer Science

Rational Univariate Reduction via toric resultants

Journal of Symbolic Computation

Computing the global optimum of a multivariate polynomial over the reals

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation

Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping

Computer Mathematics

Stable normal forms for polynomial system solving

Theoretical Computer Science

On the topology of planar algebraic curves

Proceedings of the twenty-fifth annual symposium on Computational geometry

Evaluation techniques for zero-dimensional primary decomposition

Journal of Symbolic Computation

Generators of the ideal of an algebraic space curve

Journal of Symbolic Computation

Evaluation properties of invariant polynomials

Journal of Symbolic Computation

A parametric representation of totally mixed Nash equilibria

Computers & Mathematics with Applications

Generalized polar varieties: geometry and algorithms

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage

Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study

Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage

On the complexity of the resolvent representation of some prime differential ideals

Journal of Complexity

Computing isolated roots of sparse polynomial systems in affine space

Theoretical Computer Science

The first rational Chebyshev knots

Journal of Symbolic Computation

On solving systems of bivariate polynomials

ICMS'10 Proceedings of the Third international congress conference on Mathematical software

On computing absolutely irreducible components of algebraic varieties with parameters

Computing

Deciding reachability of the infimum of a multivariate polynomial

Proceedings of the 36th international symposium on Symbolic and algebraic computation

Bit-size estimates for triangular sets in positive dimension

Journal of Complexity

Root isolation of zero-dimensional polynomial systems with linear univariate representation

Journal of Symbolic Computation

Variant quantifier elimination

Journal of Symbolic Computation

On the complexity of computing with zero-dimensional triangular sets

Journal of Symbolic Computation

Software Engineering and complexity in effective Algebraic Geometry

Journal of Complexity

Global optimization for algebraic geometry --- computing runge---kutta methods

LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization

Affine solution sets of sparse polynomial systems

Journal of Symbolic Computation

Moment matrices, border bases and real radical computation

Journal of Symbolic Computation

On the complexity of computing certain resultants

ACM Communications in Computer Algebra

Computing Puiseux series for algebraic surfaces

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation

Critical points and Gröbner bases: the unmixed case

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation

Algorithms for the universal decomposition algebra

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation

Separating linear forms for bivariate systems

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation

Critical point methods and effective real algebraic geometry: new results and trends

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation

On the complexity of solving bivariate systems: the case of non-singular solutions

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation

Modular Composition Modulo Triangular Sets and Applications

Computational Complexity