Completeness for nondeterministic complexity classes

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.

[1]  Juris Hartmanis,et al.  On Log-Tape Isomorphisms of Complete Sets , 1978, Theor. Comput. Sci..

[2]  Juris Hartmanis.  Feasible computations and provable complexity properties , 1989, CBMS-NSF regional conference series in applied mathematics.

[3]  Harry Buhrman,et al.  On the structure of complete sets , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[4]  Nancy A. Lynch,et al.  Relativization of questions about log space computability , 1976, Mathematical systems theory.

[5]  Alfred V. Aho,et al.  A Minimum Distance Error-Correcting Parser for Context-Free Languages , 1972, SIAM J. Comput..

[6]  Steven Homer,et al.  Complete Problems and Strong Polynomial Reducibilities , 1992, SIAM J. Comput..

[7]  Róbert Szelepcsényi.  The moethod of focing for nondeterministic automata , 1987, Bull. EATCS.

[8]  Nancy A. Lynch,et al.  Comparison of polynomial-time reducibilities , 1974, STOC '74.

[9]  Juris Hartmanis,et al.  On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..

[10]  R.E. Ladner,et al.  A Comparison of Polynomial Time Reducibilities , 1975, Theor. Comput. Sci..

[11]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[12]  渡邉 治.  On the structure of intractable complexity classes , 1987 .

[13]  Osamu Watanabe,et al.  A Comparison of Polynomial Time Completeness Notions , 1987, Theor. Comput. Sci..

[14]  José L. Balcázar,et al.  Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.

[15]  David A. Russo.  Optimal Approximations of Complete Sets , 1986, Computational Complexity Conference.

[16]  Neil D. Jones,et al.  Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..

[17]  Neil Immerman.  Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..