J. Hartmanis, N. Immerman, and S. Mahaney. One-way log-tape reductions. In Proc. IEEE FOCS, pages 65--71, 1978. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
A Perspective on Lindström Quantifiers and Oracles - Stewart (Correct)
Comparing Counting Classes for Logspace, One-way Logspace.. - Burtschick (1994) (Correct)
A New Parallel Vector Model, With Exact Characterizations of NC k - Regan (1993) (Correct)
Lower Bounds for One-way Probabilistic Communication Complexity.. - Ablayev (1996) (9 citations) (Correct)
On Growing Context-Sensitive Languages - Buntrock, Lorys (1992) (22 citations) (Correct)
A First-Order Isomorphism Theorem - Allender, Balcázar, Immerman (1993) (7 citations) (Correct)
NL-printable sets and Nondeterministic Kolmogorov Complexity - Allender (2004) (Correct)
A First-Order Isomorphism Theorem - Allender, Balcázar, Immerman (1993) (7 citations) Self-citation (Immerman) (Correct)
The Structure of Complete Degrees - Kurtz, Mahaney, Royer (1990) (16 citations) Self-citation (Mahaney) (Correct)
The Complexity of Iterated Multiplication - Immerman, Landau (1995) (32 citations) Self-citation (Immerman) (Correct)
Languages That Capture Complexity Classes - Immerman (1987) (189 citations) Self-citation (Immerman) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC