A convex geometric approach to counting the roots of a polynomial system

This publication has 17 references indexed in Scilit:

• A Polyhedral Method for Solving Sparse Polynomial Systems
  Mathematics of Computation, 1995
• Product formulas for resultants and Chow forms
  Mathematische Zeitschrift, 1993
• Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases
  SIAM Journal on Discrete Mathematics, 1993
• A homotopy algorithm for a symmetric generalized eigenproblem
  Numerical Algorithms, 1993
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
  Bulletin of the American Mathematical Society, 1989
• Numerical Solution of a Class of Deficient Polynomial Systems
  SIAM Journal on Numerical Analysis, 1987
• Angular momentum, convex Polyhedra and Algebraic Geometry
  Proceedings of the Edinburgh Mathematical Society, 1983
• THE GEOMETRY OF TORIC VARIETIES
  Russian Mathematical Surveys, 1978
• Newton polyhedra and the genus of complete intersections
  Functional Analysis and Its Applications, 1978
• Some Formulae in Elimination
  Proceedings of the London Mathematical Society, 1902