DSPACE(n) (Questioned equal to) NSPACE(n): A Degree Theoretic Characterization

Journal of Computer and System Sciences

Volumn 54, Issue 3, 1997, Pages 383-392

  Agrawal, Manindra ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL METHODS; FUNCTIONS; POLYNOMIALS; SET THEORY; THEOREM PROVING; TURING MACHINES;

ISOMORPHISMS; LOGSPACE REDUCTIONS; POLYNOMIAL TIME MANY ONE COMPLETE DEGREES;

COMPUTATIONAL COMPLEXITY;

EID: 0031169451     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1483     Document Type: Article

References (23)

1. M. Agrawal, On the isomorphism problem for weak reducibilities, J. Comput. System Sci. 53, No. 2 (1996), 267-282.
2. M. Agrawal and E. Allender, An isomorphism theorem for circuit complexity, in "Proc. 11th Conference on Computational Complexity, 1996," pp. 2-11.
3. M. Agrawal and S. Biswas, Polynomial isomorphism of 1-L-complete sets, in "Proc. 8th Structure in Complexity Theory Conference, 1993," pp. 75-80.
4. E. W. Allender, Isomorphisms and 1-L reductions, J. Comput. System Sci. 36, No. 6 (1988), 336-350.
5. L. Berman, "Polynomial Reducibilities and Complete Sets," Ph.D. thesis, Cornell University, 1977.
6. L. Berman and J. Hartmanis, On isomorphism and density of NP and other complete sets, SIAM J. Comput. 1 (1977), 305-322.
7. H. Burtschick and A. Hoene, The degree structure of 1-L reductions, in "Proc. Math. Foundation of Computer Science," Lecture Notes in Computer Science, Vol. 629, pp. 153-161, Springer-Verlag, New York/ Berlin, 1992.
8. S. Fenner, L. Fortnow, and S. Kurtz, The isomorphism conjecture holds relative to an oracle, in "Proc. 33rd IEEE Symposium on Foundations of Computer Science, 1992," pp. 30-39, SIAM J. Comput., to appear.
9. S. Fenner, L. Fortnow, and S. Kurtz, The isomorphism conjecture holds relative to an oracle, in "Proc. 33rd IEEE Symposium on Foundations of Computer Science, 1992," pp. 30-39, SIAM J. Comput., to appear.
10. S. Fenner, S. Kurtz, and J. Royer, P = PSPACE iff every 1-degree collapses, in "Proc. 30th IEEE Symposium on Foundations of Computer Science, 1989," pp. 624-629.
11. K. Ganesan and S. Homer, Complete problems and strong polynomial reducibilities, in "Proc. Symposium on Theoretical Aspects of Computer Science," Lecture Notes in Computer Science, Vol. 349, pp. 240-250, Springer-Verlag, New York/Berlin, 1988.
12. J. Hartmanis, On log-tape isomorphisms of complete sets, Theoret. Comput. Sci. (1978), 273-286.
13. J. Hartmanis, N. Immerman, and S. Mahaney, One-way log-tape reductions, in "Proc. 19th IEEE Symposium on Foundations of Computer Science, 1978," pp. 65-72.
14. J. Hartmanis and S. Mahaney, Languages simultaneously complete for one-way and two-way log-tape automata, SIAM J. Comput. 10, No. 2 (1981), 383-390.
15. L. A. Hemchandra and A. Hoene, Collapsing degrees via strong computation, in "Proc. International Colloquium on Automata, Languages and Programming," Lecture Notes in Computer Science, Vol. 510, pp. 393-404, Springer-Verlag, New York/Berlin, 1991.
16. N. Immermann, Nondeterministic space is closed under complementation, SIAM J. Comput. 17 (1988), 935-938.
17. D. Joseph and P. Young, Some remarks on witness functions for nonpolynomial and noncomplete sets in NP, Theoret. Comput. Sci. 39 (1985), 225-237.
18. K. Ko, T. Long, and D. Due, A note on one-way functions and polynomial-time isomorphisms, Theoret. Comput. Sci. 47 (1987), 263-276.
19. S. Kurtz, S. Mahaney, and J. Royer, The structure of complete degrees, in "Complexity Theory Retrospective" (A. Selman, Ed.), pp. 108-146, Springer-Verlag, New York/Berlin, 1988.
20. S. Kurtz, S. Mahaney, and J. Royer, The isomorphism conjecture fails relative to a random oracle, in "Proc. 21st ACM Symposium on Theory of Computing, 1989," pp. 157-166.
21. L. J. Stockmeyer, "The Complexity of Decision Problems in Automata Theory and Logic," Ph.D. thesis, Massachusetts Institute of Technology, 1974.
22. R. Szelepcsényi, The method of forced enumeration for nondeterministic automata, Acta Informatica 26 (1988), 279-284.
23. O. Watanabe, On one-one polynomial time equivalence relations, Theoret. Comput. Sci. 38 (1985), 157-165.