Skip to main content
SpringerLink
Log in

Nondeterministic Turing machines with modified acceptance

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1986 (MFCS 1986)

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

Abstract

The complexity classification of problems defined by restricting NP-complets problems to those instances having unique solutions requires still finer hierarchies within BC(NP) (the Boolean closure of NP) than that introduced in [Wec 85] (see also [WeWa 85], [GuWe 85], [CaHe 85] and [KöSc 85]) which will be called the Hausdorff hierarchy generated by NP. In this paper an extremely fine hierarchy within BC(NP) is proposed. The classes of this hierarchy are characterized by nondeter-ministic polynomial time Turing machines with suitably modified acceptance notions (Section 2). Complete sets for the classes of the hierarchy are presented in Section 5. The hierarchy is studied under relativizations (Sections 3 and 5). Section 4 yields more insight in the structure of the hierarchy.

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.

Literature

  1. Blass, A., Yu. Gurevich, On the unique satisfiability problem. Inf. & Contr. 55 (1982), 80–88.

    Google Scholar 

  2. Cai, Jin-yi, L. Hemachandra, The Boolean Hierarchy: Hardware over NP. Reprint Cornell Comp. Sc. Dept., 1985.

    Google Scholar 

  3. Gundermann, Th., G. Wechsung, Relativizing the Hausdorff hierarchy generated by NP. To appear.

    Google Scholar 

  4. Counting classes with finite acceptance types. To appear.

    Google Scholar 

  5. Hausdorff, F., Grundzüge der Mengenlehre, Leipzig 1914.

    Google Scholar 

  6. Köbler, J., U. Schöning, The difference and truth-table hierarchies for NP. Submitted to RAIRO Inf. théor.

    Google Scholar 

  7. Papadimitriou, Ch.H., M. Yannakakis, The complexity of facets (and some facets of complexity). 14th STOC (1982), 255–260. See also: JCSS 28 (1984), 244–259.

    Google Scholar 

  8. Valiant, L.G., V.V. Vazirani, NP is as easy as detecting unique solutions. 17th STOC (1985), 458–563.

    Google Scholar 

  9. Wagner, K., More complicated questions about Maxima and Minima and some closures of NP. To appear

    Google Scholar 

  10. Wechsung, G., On the Boolean closure of NP. Proc. FCT'85, LNCS 199, 485–493.

    Google Scholar 

  11. Wechsung, G., K. Wagner, On the Boolean closure of NP. Submitted to JCSS.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Friedrich Schiller University Jena, German Democratic Republic

    Thomas Gundermann & Gerd Wechsung

Authors
  1. Thomas Gundermann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerd Wechsung
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jozef Gruska Branislav Rovan Juraj Wiedermann

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gundermann, T., Wechsung, G. (1986). Nondeterministic Turing machines with modified acceptance. In: Gruska, J., Rovan, B., Wiedermann, J. (eds) Mathematical Foundations of Computer Science 1986. MFCS 1986. Lecture Notes in Computer Science, vol 233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0016264

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-39909-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation