Skip to main content
SpringerLink
Log in

Complexity classes with complete problems between P and NP-C

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1989)

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

Included in the following conference series:

Abstract

We study certain language classes located between P and NP that are defined by polynomial time machines with bounded amount of nondeterminism. We observe that these classes have complete problems, and find characterizations of the classes using robust machines with bounded access to the oracle, and in terms of nondeterministic complexity classes with polylog running time. We also study the relationship of these classes to P and NP.

The research of this author was supported by CIRIT grant EE87/2

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. L. Adleman: Time, Space and Randomness. Tech Report MIT/LCS/TM-131, MIT 1979.

    Google Scholar 

  2. E. Allender: Invertible functions. Ph.D. dissertation, Georgia Institute of Technology, 1985.

    Google Scholar 

  3. I. Baker, J. Gill, R. Solvay: Relativization of the P=?NP question. SIAM J. Comput., 4, 1975, 431–442.

    Article  Google Scholar 

  4. J.L. Balcázar: En torno a oraculos que ciertas maquinas consultan, y las espantables consecuencias a que ello da lugar Ph.D. dissertation, FIB. 1984.

    Google Scholar 

  5. J.L. Balcázar, J.Diaz, J.Gabarró: Structural Complexity, (Vol.1) 1988, Springer-Verlag.

    Google Scholar 

  6. P. Berman: Relationships between density and deterministic complexity of NP-complete languages. Proceedings 5th ICALP, 1978, 63–72.

    Google Scholar 

  7. R. Book: Tally languages and complexity classes. Information and Control, 1974, 186–193.

    Google Scholar 

  8. J. Cai, L. Hemachandra: On the power of parity. Symp. Theor. Aspects of Comput. Sci. 1989, 229–240.

    Google Scholar 

  9. J. Gill: Computational complexity of probabilistic Turing machines. SIAM J. Comput., 6, 1977, 675–695.

    Article  Google Scholar 

  10. J. Hartmanis, L. Hemachandra: Complexity classes without machines: on complete languages for UP. 13th. ICALP, 1986, 123–135.

    Google Scholar 

  11. J. Hartmanis, L. Hemachandra: One-way functions, robustness, and the nonisomorphism of NP-complete sets. 2nd Structure in Complexity Theory Conference, 1987, 160–175.

    Google Scholar 

  12. L. Hemachandra, G. Wechsung: Using randomness to characterize the complexity of computation. To appear in IFIP 89.

    Google Scholar 

  13. R. Impagliazzo, M. Naor: Decision Trees and Downward Closures. 3rd. Structure in Complexity Theory Conference, 1988, 29–38.

    Google Scholar 

  14. N. Jones, W. Laaser: Complete problems for deterministic polynomial time. Theoretical Computer Science, 3, 1976, 105–118.

    Article  Google Scholar 

  15. C. Kintala, P. Fisher: Refining nondeterminism in relativized complexity classes. SIAM J. Comput., 13, 1984, 329–337.

    Article  Google Scholar 

  16. K. Ko: On helping by robust oracle machines. Theoretical Computer Science, 52, 1987, 15–36.

    Article  Google Scholar 

  17. J. Köbler, U. Schöning, S. Toda, J. Torán: Turing machines with few accepting computations and low sets for PP. To appear in 4th Structure in Complexity Theory Conference, 1989.

    Google Scholar 

  18. R. Ladner: On the structure of polynomial time reducibility. J.ACM, 22 1975, 155–171.

    Article  Google Scholar 

  19. S. Mahaney: Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis. In Proceedings IEEE Symposium on Foundations of Computer Science, 1980, 54–60.

    Google Scholar 

  20. U. Schöning, R. Book: Immunity, relativizations, and nondeterminism. SIAM J. Comput., 9, 1984, 46–53.

    Google Scholar 

  21. U. Schöning: Robust algorithms: a different approach to oracles. Theoretical Computer Science, 40, 1985, 57–66.

    Article  Google Scholar 

  22. U. Schöning: Complexity and Structure. Lecture Notes in Computer Science, 1986, Springer-Verlag.

    Google Scholar 

  23. U. Schöning: Robust oracle machines. Proceedings 13th Math. Fundations of Computer Science, 1988, 93–107.

    Google Scholar 

  24. L. Valiant: Relative complexity of checking and evaluating. Information Processing Letters, 5, 1976, 20–23.

    Article  Google Scholar 

  25. M. Xu, J. Doner, R. Book: Refining nondeterminism in relativizations of complexity classes. JACM 30, 1983, 677–685.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departament de Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Pau Gargallo 5, 08028, Barcelona

    Carme Àlvarez, Josep Díaz & Jacobo Torán

Authors
  1. Carme Àlvarez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Josep Díaz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jacobo Torán
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. Csirik J. Demetrovics F. Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Àlvarez, C., Díaz, J., Torán, J. (1989). Complexity classes with complete problems between P and NP-C. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-51498-8_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48180-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation