Skip to main content

Abstract

We begin by establishing the smoothness and irreducibility of certain algebraic varieties. Whereas these facts must be standard to algebraic geometers, they do not seem readily available.

Partially supported by an NSF grant

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Baker, A., Transcendental Number Theory, Cambridge University Press, Cambridge, 1975.

    Book  MATH  Google Scholar 

  • Blum, L., Shub, M., and Smale, S., On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines, Bull. Amer. Math. Soc. 21 (1989), 1–46.

    Article  MathSciNet  MATH  Google Scholar 

  • Borwein, J. and Borwein, P., Pi and the AGM, Wiley, New York, 1987.

    MATH  Google Scholar 

  • Canny, J.F., Generalized characteristic polynomials, J. Symbol Comput. 9 (1990), 241–250.

    Article  MathSciNet  MATH  Google Scholar 

  • Dold, A., Lectures on Algebraic Topology, 2nd ed., Springer-Verlag, Berlin, 1980.

    MATH  Google Scholar 

  • Lang, S., Elliptic Curves Diophantine Analysis, Springer-Verlag, Berlin, 1978.

    MATH  Google Scholar 

  • Macauley, F.S., The Algebraic Theory of Modular Systems, Cambridge Tracts in Mathematics and Mathematical Physics, No. 10, Steckart-Hafner Service Agency, New York, 1964.

    Google Scholar 

  • Renegar, J., On the worst case arithmetic complexity of approximating zeros of systems of polynomials, SIAM J. Comput. 18 (1989), 350–370.

    Article  MathSciNet  MATH  Google Scholar 

  • Shub, M., On the distance to the zero set of a homogeneous polynomial, J. Complexity 5 (1989), 303–305.

    Article  MathSciNet  MATH  Google Scholar 

  • Van der Waerden, B.L., Modern Algebra, Vol. II, Frederick Unger, New York, 1950.

    Google Scholar 

  • Zulehner, W., A simple homotopy method for determining all isolated solutions to polynomial systems, Math. Comp. 50 (1988), 167–177.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag New York, Inc.

About this chapter

Cite this chapter

Shub, M. (1993). Some Remarks on Bezout’s Theorem and Complexity Theory. In: Hirsch, M.W., Marsden, J.E., Shub, M. (eds) From Topology to Computation: Proceedings of the Smalefest. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-2740-3_40

Download citation

  • DOI: https://doi.org/10.1007/978-1-4612-2740-3_40

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4612-7648-7

  • Online ISBN: 978-1-4612-2740-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics