Skip to main content
SpringerLink
Log in

Reduction to NP-complete problems by interpretations

  • Section V: Spektralproblem
  • Conference paper
  • First Online:
Logic and Machines: Decision Problems and Complexity (LaM 1983)

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

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. Asser "Das Representantenproblem im Prädikatenkalkül der ersten Stufe mit Identität", ZML 1,p.252–263, 1955.

    Google Scholar 

  2. Dahlhaus "Kombinatorische und logische Eigenschaften von Reduktionen auf einige vollständige Probleme in NP und NL", Doctoral Dissertation, TU Berlin, 1982.

    Google Scholar 

  3. Enderton: "A Mathematical Introduction to Logic", Academic Press, 1972.

    Google Scholar 

  4. Fagin: "Generalized First Order Spectra and Polynomial Time Recognizable Sets", Karp (ed.) "Complexity of Computations"; SIAM-AMS Proc. 7, p. 27–41.

    Google Scholar 

  5. Hartmanis Immerman Mahaney: "One-Way Log Tape Reductions", IEEE-FOCS 19, p. 65–72, 1978.

    Google Scholar 

  6. Immerman: "Languages which capture Complexity Classes", 15th ACM-STOC, p. 347–354, 1983.

    Google Scholar 

  7. Jones, Selman: "Turing Machines and Spectra of First Order Formulas", JSL 39, p. 139–150, 1974.

    Google Scholar 

  8. Karp: "Reducibility among Combinatorial Problems", Miller/Thatcher (eds.) "Complexity of Computations", Plenum Press, New York, 1972.

    Google Scholar 

  9. Lovász, Gács: "Some Remarks on Generalized Spectra", ZML 23, p. 547–554, 1977.

    Google Scholar 

  10. Rödding, Schwichtenberg: "Bemerkungen zum Spektralproblem", ZML 18, p. 1–12, 1972.

    Google Scholar 

  11. Scholz: "Ein ungelöstes Problem der symbolischen Logik", JSL 17, p. 160, 1952.

    Google Scholar 

  12. Tarski: "Undecidable Theories", North Holland Publishing Company, 1953.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik, Technische Universität Berlin, D-1000, Berlin 12

    Elias Dahlhaus

Authors
  1. Elias Dahlhaus
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. Börger G. Hasenjaeger D. Rödding

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dahlhaus, E. (1984). Reduction to NP-complete problems by interpretations. In: Börger, E., Hasenjaeger, G., Rödding, D. (eds) Logic and Machines: Decision Problems and Complexity. LaM 1983. Lecture Notes in Computer Science, vol 171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13331-3_51

Download citation

  • DOI: https://doi.org/10.1007/3-540-13331-3_51

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13331-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation