Skip to main content
SpringerLink
Log in
Book cover

Latin American Symposium on Theoretical Informatics

LATIN 1992: LATIN '92 pp 117–129Cite as

On the complexity of some problems for the Blum, Shub & Smale model

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 583))

Abstract

We show some problems deriving from real algebra and semialgebraic geometry to be NP-complete or coNP-complete for the Blum, Shub and Smale model of computation. We also introduce a class of languages R lying between P and NP that uses probabilistic machines, and several problems from the same area are classified as “probably noncomplete” by showing their membership in R.

Partially supported by DGICyT PB 860062 and the ESPRIT Basic Research Action Program of the EC under contract no. 3075, project ALCOM.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.L. Balcázar, J. Díaz and J. Gabarró; Structural Complexity, vol.1, EATCS Monographs of Theoretical Computer Science, Springer Verlag, 1988.

    Google Scholar 

  2. L. Blum, M. Shub and S. Smale; “On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines”. Bulletin of the Amer. Math. Soc., vol.21, n.1, pp.1–46, 1989. A preliminary version appeared in 29th Found. of Comp. Sc. pp.387–397, 1988.

    Google Scholar 

  3. J. Bochnak, M. Coste and M.-F. Roy; Géométrie algébrique réelle. Ergebnisse der Math., 3.Folge, Band 12, Springer Verlag, 1987.

    Google Scholar 

  4. D. Grigor′; “Complexity of deciding Tarski algebra”. J. of Symb. Comp., 5, pp.65–108, 1988.

    Google Scholar 

  5. J. Heintz, T. Krick, M.-F. Roy and P. Solerno;“Single exponential time algorithms for basic constructions in elementary geometry”, Proceedings of the 10th Int. Conf. of the Chilean Comp. Sc. Soc., Santiago de Chile, 1990.

    Google Scholar 

  6. J. Heintz, M.-F. Roy and P. Solerno; “Sur la complexité du principe de Tarski-Seidenberg”. Bull. Soc. Math. France, 118, pp.101–126, 1990.

    Google Scholar 

  7. M. Mignote; “Some useful bounds” in Computer Algebra, Symbolic and Algebraic Computation, pp.259–263, Springer Verlag, 1982.

    Google Scholar 

  8. J. Renegar; “On the computational complexity and geometry of the first order thery of the reals”, parts I, II and III. Cornell University, Technical Reports 853,854 and 856, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Llenguatges i Sistemes Informàtics, Univ. Politècnica de Catalunya, 08028, Barcelona, Spain

    Felipe Cucker

  2. Dept. Matemàtiques i Informàtica, Univ. de les Illes Balears Palma de, 07071, Mallorca, Spain

    Francesc Rosselló

Authors
  1. Felipe Cucker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francesc Rosselló
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Imre Simon

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cucker, F., Rosselló, F. (1992). On the complexity of some problems for the Blum, Shub & Smale model. In: Simon, I. (eds) LATIN '92. LATIN 1992. Lecture Notes in Computer Science, vol 583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023823

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation