Skip to main content
Springer Nature Link
Log in

Completeness with respect to interpretations in deterministic and nondeterministic polynomial time

  • Conference paper
  • First Online:
CSL '88 (CSL 1988)

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

Included in the following conference series:

  • 154 Accesses

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. V. Arvind, S. Biswas, “Expressibility of First Order Logic with a Nondeterministic Induction Operator”, STACS 87, LNCS 247 (1984), p. 323–335

    Google Scholar 

  2. L. Babai, L. Kucera, “Canonical Labellings of Graphs in Linear Average Time”, 20th FOCS (1979), p. 39–64

    Google Scholar 

  3. A. Chandra, D. Harel, “Structure and Complexity of Relational Queries”, Journal of Computer and Systems Sciences 25 (1982), p. 99–128

    Article  Google Scholar 

  4. S. Cook “A Taxonomy of Problems with Fast Parallel Algorithms”, Information and Control 64 (1985), p. 2–22

    Article  Google Scholar 

  5. E. Dahlhaus, “Reductions to NP-Complete Problems by Interpretations“ in “Logic and Machines: Decision Problems and Complexity”, E. Börger, G. Hasenjaeger, D. Rödding ed. (1983), LNCS 171, p. 357–366

    Google Scholar 

  6. E. Dahlhaus, “Skolem Normal Forms Concerning the Least Fixpoint”, in “Computation Theory and Logic“ (in honour to D. Rödding), E. Börger ed., LNCS 270 (1987), p. 101–107

    Google Scholar 

  7. M. de Rougemont, “Second Order and Inductive Definability on Finite Structures”, Zeitschrift für Mathematische Logik und Grundlagen 32 (1987), p. 47–63

    Google Scholar 

  8. R. Fagin, “Generalized First Order Spectra and Polynomial Time Recognizable Sets”, SIAM-AMS-Proceedings 7 (1974), p. 43–73

    Google Scholar 

  9. Y. Gurevich, S. Shelah, “Fixed Point Extension of First Order Logic”, Annals of Pure and Applied Logic 32 (1986), p. 265–280

    Article  Google Scholar 

  10. Y. Gurevich, “Toward Logic Tailored for Computational Complexity”, Computation and Proof Theory, Proceedings of the Logic Colloquium, M. Richter et al. ed., Lecture Notes in Mathematics 1104, p. 175–216

    Google Scholar 

  11. N. Immerman, “Languages, which Capture Complexity Classes”, SIAM-Journal of Computing 16 (1987), p. 760–778

    Article  Google Scholar 

  12. N. Immerman, “Relational Queries Computable in Polynomial Time”, Information and Control 68(1986), p. 86–104

    Article  Google Scholar 

  13. N. Jones, W. Laaser, “Complete Problems for Deterministic Polynomial Time”, Theoretical Computer Science 3(1977), p. 105–117

    Article  Google Scholar 

  14. N. Jones, A. Selman, “Turing Machines and the Spectra of First Order Formulas”, Journal of Symbolic Logic 39 (1974), p. 139–150

    Google Scholar 

  15. L. Lovász, P. Gács, “Some Remarks on Generalized Spectra”, Zeitschrift für Mathematische Logik und Grundlagen 23(1977), p. 547–554

    Google Scholar 

  16. D. Rödding, H. Schwichtenberg, “Bemerkungen zum Spektralproblem”, Zeitschrift für Mathematische Logik und Grundlagen 18(1972), p. 1–12

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informatik III Universität Bonn, Römerstraße 164, 5300, Bonn 1, West Germany

    Elias Dahlhaus

Authors
  1. Elias Dahlhaus
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dahlhaus, E. (1989). Completeness with respect to interpretations in deterministic and nondeterministic polynomial time. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '88. CSL 1988. Lecture Notes in Computer Science, vol 385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026294

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46736-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics