One-way log-tape reductions

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1978-October, Issue , 1978, Pages 65-72

  Hartmanis, J ^a   Immerman, N ^a   Mahaney, S ^a  

^a Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMPLETE SETS; COMPLEXITY CLASS; L-REDUCTION; READ HEADS; RECURSION THEORY;

TURING MACHINES;

EID: 85034828463     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.1978.31     Document Type: Conference Paper

References (9)

1. Aho, A.V., J.E. Hopcroft and J. D. Ullman, "The Design and Analysis of Computer Algorithms," Addison-Wesley Publishing Co., Reading, Mass., 1974.
2. Cook, S.A., "The Complexity of Theorem Proving Procedures," Proceedings 3rd Annual ACM Symposium on Theory of Computing, May 1971, 151-158.
3. Galil, Z., "Some Direct Encodings of Nondeterministic Turing Machines Operating in Polynomial Time into NP-Complete Problems," SIGACT NEWS No. 1, January 1974, 19-24.
4. Jones, N. D., "Space-Bounded Reducibility Among Combinatorial Problems," J. of Computer and System Sciences, Vol. 11, (1975), 68-85.
5. Jones, N. D., and W.T. Laaser, "Problems Compete for Deterministic Polynomial Time," Theoretical Computer Science, Vol. 3, (1977) 105-117.
6. Jones, N. D., Y. E. Lien and W. T. Laaser, "New Problems Complete for Log Space," Mathematical Systems Theory, Vol. 10, (1976) 1-17.
7. Karp, R.M., "Reducibility Among Combinatorial Problems," In Complexity of Computer Computations, edited by R.E. Miller and J. Thatcher, Plenum Press, New York 1972, 85-104.
8. Ladner, R.E., "Polynomial Time Reducibility," Proceedings 5th Annual ACM Symposium on Theory of Computing, April 1973, 122-129.
9. Savitch, W.J., "Relations Between Nondeterministic and Deterministic Tape Complexities," J. of Computer and System Sciences, Vol. 4, (1970), 122-129.