Skip to main content
SpringerLink
Log in
Book cover

Effective Methods in Algebraic Geometry pp 491–500Cite as

Birkhäuser

Deciding Consistency of Systems of Polynomial in Exponent Inequalities in Subexponential Time

  • Chapter

Part of the book series: Progress in Mathematics ((PM,volume 94))

Abstract

Let h ∈ Z[X 1,…, X n ] be an arbitrary polynomial.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tarski, A., “A Decision Method for Elementary Algebra and Geometry,” University of California Press, 1951.

    Google Scholar 

  2. Collins, G. E., Quantifier elimination for real closed fields by cylindrical algebraic decomposition, in “Second GI Conf. Automata Theory and Formal Languages,” Lect. Notes Comp. Sci. 33, 1975, pp. 134–183.

    Google Scholar 

  3. Wüthrich, H. R., Ein Enttscheidungsverfahren für die Theorie der reall-abgeschlossenen Körper, in “Komplexität von Entscheidungsproblemen: ein Seminar,” Lect. Notes Comp. Sci. 43, 1976, pp. 138–162.

    Article  Google Scholar 

  4. Grigor’ev, D. Yu., Vorobjov, N. N., Jr., Solving systems of polynomial inequalities in subexponential time, J. Symbolic Comp. 5 (1988), 37–64.

    Article  MathSciNet  Google Scholar 

  5. Renegar, J., A faster PSPACE algorithm for deciding the existential theory of the reals, Technical report N 792, College of Engineering, Cornell University.

    Google Scholar 

  6. Hovansky, A. G., On a class of systems of transcendental equations, Soviet Math. Dokl. 22 (1980), 762–765.

    Google Scholar 

  7. Waldschmidt, M., Simultaneous approximation of numbers connected with the exponential function, J. Austral. Math. Soc. (series A) 25 (1978), 466–478.

    Article  MathSciNet  MATH  Google Scholar 

  8. Davis, M., “Applied Nonstandard Analysis,” J. Wiley., New York, 1977.

    MATH  Google Scholar 

  9. Milnor, J., On the Betti numbers of real varieties, Proc. Amer. Math. Soc. 15(2) (1964), 275–280.

    Article  MathSciNet  MATH  Google Scholar 

  10. Chistov, A. L., Grigor’ev, D. Yu., Complexity of quantifier elimination in the theory of algebraically closed fields, in “Mathematical Foundations of Computer Science, Praha 198,” Lect. Notes Comp. Sci. 176, 1984, pp. 17–31.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Leningrad State University Universitetskaya emb., 7/9 Leningrad, 199164, USSR

    Nikolaj N. Vorobjov Jr.

Authors
  1. Nikolaj N. Vorobjov Jr.
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento de Matematica, Università di Genova, Via L. B. Alberti 2, I-16100, Genova, Italy

    Teo Mora

  2. Dipartimento de Matematica, Università di Pisa, Via Buonarroti 2, 56127, Pisa, Italy

    Carlo Traverso

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer Science+Business Media New York

About this chapter

Cite this chapter

Vorobjov, N.N. (1991). Deciding Consistency of Systems of Polynomial in Exponent Inequalities in Subexponential Time. In: Mora, T., Traverso, C. (eds) Effective Methods in Algebraic Geometry. Progress in Mathematics, vol 94. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0441-1_33

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-0441-1_33

  • Publisher Name: Birkhäuser, Boston, MA

  • Print ISBN: 978-1-4612-6761-4

  • Online ISBN: 978-1-4612-0441-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation