Abstract
We demonstrate differences between reducibilities and corresponding completeness notions for nondeterministic time and space classes. For time classes the studied completeness notions under polynomial-time bounded (even logarithmic-space bounded) reducibilities turn out to be different for any class containingNE. For space classes the completeness notions under logspace reducibilities can be separated for any class properly containingLOGSPACE. Key observation in obtaining the separations is the honesty property of reductions, which was recently observed to hold for the time classes and can be shown to hold for space classes.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balcázar J. L., J. Díaz, and J. Gabarró. Structural complexity I. (W. Brauer, G, Rozenberg, and A, Salomaa, eds.). EATCS Monographs on Theoretical Computer Science, Vol. 11. Springer-Verlag, New York, 1988.
Berman L. On the structure of complete sets.Proc. 17th IEEE Conference on Foundations of Computer Science, 1976, pp. 76–80.
Berman L., and J. Hartmanis. On isomorphisms and density ofNP and other complete sets.SIAM J. Comput. 1 (1977), 305–322.
Cook, S. A. The complexity of theorem-proving procedures.Proc. Third ACM Symposium on Theory of Computing, 1971, pp. 151–158.
Ganesan K. and S. Homer. Complete Problems and Strong Polynomial Reducibilities. Technical Report #88-001, Boston University, January 1988. Also inAspects of Computer Science. Lecture Notes in Computer Science, Vol. 349. Springer-Verlag, Berlin, 1989, pp. 240–250.
Hartmanis J.Feasible Computations and Provable Complexity Properties. NSF Regional Conference Series in Applied Mathematics, 1978.
Hartmanis J. On the logtape isomorphism of complete sets.Theoret. Comput. Sci. 7 (1978), 273–286.
Immerman N. Nondeterministic space is closed under complementation.SIAM J. Comput. 17 (1988), 935–938.
Jones N. Space bounded reducibilities among combinatorial problems.J. Comput. System Sci. 11 (1975), 68–85.
Karp R. M. Reducibility among combinatorial problems. InComplexity of Computer Computations (R. E. Miller and J. W. Thatcher, eds.), Plenum, New York, pp. 85–103.
Ladner R. and N. Lynch. Relativizations of questions about log space computability.Math. Systems Theory 10 (1975), 19–32.
Ladner R. E., N. Lynch, and A. L. Selman. A comparison of polynomial time reducibilities.Theoret. Comput. Sci. 1 (1975), 103–123.
Russo D. Optimal approximations of complete sets.Proc. Structure in Complexity Theory Conference, 1986. Lecture Notes in Computer Science, Vol. 223, Springer-Verlag, Berlin, 1986, pp. 311–324.
Szelepcsényi R. The method of forcing for nondeterministic automata.Bull. EATCS 33 (1987), 96–100.
Watanabe O. A comparison of polynomial time completeness notions.Theoret. Comput. Sci. 54 (1987), 249–265.
Watanabe O. On the Structure of Intractable Complexity Classes. Ph.D. thesis, Department of Computer Science, Tokyo Institute of Technology, 1987.
Author information
Authors and Affiliations
Additional information
The work of S. Homer was supported in part by National Science Foundation Grants MIP-8608137 and CCR-8814339 and a Fulbright-Hays Research Fellowship. Some of this research was done while he was a Guest Professor at the Mathematics Institute of Heidelberg University.
Rights and permissions
About this article
Cite this article
Buhrman, H., Homer, S. & Torenvliet, L. Completeness for nondeterministic complexity classes. Math. Systems Theory 24, 179–200 (1991). https://doi.org/10.1007/BF02090397
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02090397