Skip to main content
SpringerLink
Log in

Two P-complete problems in the theory of the reals

  • Algorithms (Session 13)
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1991)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, J.E. Hopcroft and J.D. Ullman; The design and analysis of computer algorithms. Addison-Wesley, Reading, Mass., 1974.

    Google Scholar 

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

    Google Scholar 

  3. M. Ben-Or; “Lower bounds for algebraic computation trees”. A.C.M. Symp. on Theory of Computing 5, pp.80–86, 1988.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. 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 

  6. J. von zur Gathen; “Parallel arithmetic computations: a survey”, Proc. 12 th Int. Symp. Math. Found. Comp. Sc., LNCS 233, pp.93–112, Springer Verlag, 1986.

    Google Scholar 

  7. J. von zur Gathen; “Algebraic complexity theory”, Ann. Rev. Comput. Sci., 3, pp.317–347, 1988.

    Google Scholar 

  8. N.D. Jones and W.T. Laaser; “Complete problems for deterministic polynomial time”, Theor. Comp. Sc. 3, pp.105–117, 1977.

    Google Scholar 

  9. F.P. Preparata and M.I. Shamos; Computational Geometry: an introduction. Texts and Monographs in Computer Science, Springer Verlag, 1985.

    Google Scholar 

  10. L.J. Stockmeyer and U. Vishkin; “Simulation of parallel random access machines by circuits”, SIAM J. on Comp. 13, pp.409–422, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. L.S.I., Univ. Politècnica de Catalunya, 08028, Barcelona, Spain

    F. Cucker

  2. Dept. Matemàtica Aplicada II, Univ. Politècnica de Catalunya, 08028, Barcelona, Spain

    A. Torrecillas

Authors
  1. F. Cucker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Torrecillas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Javier Leach Albert Burkhard Monien Mario Rodríguez Artalejo

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cucker, F., Torrecillas, A. (1991). Two P-complete problems in the theory of the reals. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_163

Download citation

  • DOI: https://doi.org/10.1007/3-540-54233-7_163

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54233-9

  • Online ISBN: 978-3-540-47516-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation