Skip to main content

Complexity of the computation of cylindrical decomposition and topology of real algebraic curves using Thom's lemma

Part of the Lecture Notes in Mathematics book series (LNM,volume 1420)

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • 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. A. Aho, J. Hopcroft, J. Ullman: The design and analysis of computer algorithms. Addison Wesley, Reading (1974).

    MATH  Google Scholar 

  2. D. Arnon, S. McCallum: A polynomial-time algorithm for the topological type of a real algebraic curve. J. of Symbolic Computation 5 213–236 (1988).

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. M. Coste, M.-F. Roy: Thom's lemma, the coding of real algebraic numbers and the topology of semi-algebraic sets. J. of Symbolic computation 5 121–130 (1988).

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. L.Gonzalez, H. Lombardi, T.Recio, M.-F. Roy: Specialisation de la suite de Sturm et sous-résultants. To appear in RAIRO Informatique théorique.

    Google Scholar 

  5. P. Gianni, C. Traverso: Shape determination of real curves and surfaces. Ann. Univ. Ferrara SezVII Sec. Math. vol XXIX 87–109 (1983).

    MathSciNet  MATH  Google Scholar 

  6. M. Kac: On the average number of real roots of a random algebraic equation. Bull. Amer. Math. soc. 49 (1943).

    Google Scholar 

  7. R. Loos: Generalized polynomial remainder sequences. In Computer algebra, symbolic and algebraic computation. Springer Verlag, Berlin (1982).

    CrossRef  MATH  Google Scholar 

  8. M. Mignotte: Some useful bounds. In Computer algebra, symbolic and algebraic computation. Springer Verlag, Berlin (1982).

    CrossRef  MATH  Google Scholar 

  9. M.-F. Roy: Computation of the topology of a real algebraic curve. To appear in Computational geometry and topology, Congress in Sevilla 1987.

    Google Scholar 

  10. M.-F. Roy, A. Szpirglas: Complexity of the computation on real algebraic numbers. To appear in the Journal of Symbolic Computation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1990 Springer-Verlag

About this paper

Cite this paper

Roy, MF., Szpirglas, A. (1990). Complexity of the computation of cylindrical decomposition and topology of real algebraic curves using Thom's lemma. In: Galbiati, M., Tognoli, A. (eds) Real Analytic and Algebraic Geometry. Lecture Notes in Mathematics, vol 1420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0083923

Download citation

  • DOI: https://doi.org/10.1007/BFb0083923

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52313-0

  • Online ISBN: 978-3-540-46952-0

  • eBook Packages: Springer Book Archive