Skip to main content
SpringerLink
Log in

An introduction to the theory of computational complexity

  • Conference paper
  • First Online:
Measures of Complexity

Part of the book series: Lecture Notes in Physics ((LNP,volume 314))

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. M. BLUM A machine independent theory of complexity of recursive functions, J.ACM 14:2, 322–336, 1967.

    Google Scholar 

  2. S.A. COOK The classification of problems which have fast parallel algorithms, Lecture Notes in Computer Science 158, Springer-Verlag, Berlin, 78–93, 1983.

    Google Scholar 

  3. M.R. GAREY and D.S. JOHNSON Computers and intractability: A guide to the theory of NP-completeness, Freeman, New York, NY, 1969.

    Google Scholar 

  4. L. M. GOLDSCHLAGER A universal interconnection pattern for parallel computers, J.ACM 29:3, 1073–1086, 1982.

    Google Scholar 

  5. J. HARTMANIS and R.E STEARNS On the computational complexity of algorithms, Trans Amer. Math. Soc. 117, 285–306, 1965.

    Google Scholar 

  6. M. LEE and Y. YESHA Separation and lower bounds for ROM and nondeterministic models of parallel computation, Information and Computation 73, 102–128, 1987.

    Google Scholar 

  7. Y. TAO, H. ZHIJUN and Y. RUIZHAO Performance evaluation of the inference structure in expert system, REASONING, 945–950,1987.

    Google Scholar 

  8. A.M. TURING On computable numbers, with applications to the Entscheidungs problem, Proc. London Math. Soc. (2) 42, 230–265, 1937.

    Google Scholar 

  9. A. URQUHART Hard examples for resolution, J.ACM 34:1, 209–219,1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics, University of Rome “La Sapienza”, Italy

    D. P. Bovet & P. L. Crescenzi

Authors
  1. D. P. Bovet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. L. Crescenzi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

L. Peliti A. Vulpiani

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag

About this paper

Cite this paper

Bovet, D.P., Crescenzi, P.L. (1988). An introduction to the theory of computational complexity. In: Peliti, L., Vulpiani, A. (eds) Measures of Complexity. Lecture Notes in Physics, vol 314. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50316-1_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-50316-1_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50316-3

  • Online ISBN: 978-3-540-45968-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation