Skip to main content

Part of the book series: Algorithms and Computation in Mathematics ((AACIM,volume 10))

  • 2909 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 79.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 99.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 129.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

12.9 Bibliographical Notes

  1. M. E. Alonso, E. Becker, M.-F. Roy, T. Wörmann, Zeroes, Multiplicities and Idempotents for Zerodimensional Systems, Algorithms in algebraic geometry and applications, Progress in Mathematics, vol 143. Birkhauser 1–16 (1996).

    MATH  Google Scholar 

  2. S. Basu, On Bounding the Betti Numbers and Computing the Euler Characteristics of Semi-algebraic Sets, Discrete and Computational Geometry, 22 1–18 (1999).

    Article  MATH  MathSciNet  Google Scholar 

  3. B. Buchberger, An Algorithm for Finding the Basis Elements in the Residue Class Ring Modulo a Zero Dimensional Polynomial Ideal, PhD Thesis, Mathematical Institute, University of Innsbruck, Austria, (1965).

    Google Scholar 

  4. B. Buchberger, Gröbner bases: an algorithmic method in polynomial ideal theory, Recent trends in multidimensional systems theory, Reider ed. Bose, (1985).

    Google Scholar 

  5. J. Canny, Some Algebraic and Geometric Computations in PSPACE, Proc. Twentieth ACM Symp. on Theory of Computing, 460–467, (1988).

    Google Scholar 

  6. L. Gournay, J. J. Risler, Construction of roadmaps of semi-algebraic sets, Appl. Algebra Eng. Commun. Comput. 4, No.4, 239–252 (1993).

    Article  MATH  MathSciNet  Google Scholar 

  7. L. Kronecker, Werke, Vol 1. Leipzig, Teubner (1895).

    MATH  Google Scholar 

  8. J. Renegar. On the computational complexity and geometry of the first order theory of the reals, Journal of Symbolic Computation, 13: 255–352 (1992).

    Article  MATH  MathSciNet  Google Scholar 

  9. F. Rouillier, Solving Polynomial Systems through the Rational Univariate Representation, Applicable Algebra in Engineering Comunication and Computing, 9(5) 433–461 (1999).

    Article  MATH  MathSciNet  Google Scholar 

  10. F. Rouillier, M.-F. Roy, M. Safey El Din, Finding at least one point in each connected component of a real algebraic set defined by a single equation, Journal of Complexity 16, 716–750 (2000).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2006). Polynomial System Solving. In: Algorithms in Real Algebraic Geometry. Algorithms and Computation in Mathematics, vol 10. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-33099-2_13

Download citation

Publish with us

Policies and ethics