Concepedia

Problems complete for deterministic logarithmic space

Stephen Cook, Pierre McKenzie

Journal of Algorithms · 1987 · 169 citations · 14 references

DOI

Concepts

References

14

Introduction to automata theory, languages and computation

Mathematics and Computers in Simulation · 1981 · 10.9K citations

, , +10

Introduction to automata theory, languages, and computation

Computer Languages · 1980 · 6.9K citations

, , +10

J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979

悦朗 守屋 · 情報処理 · 1980 · 1.8K citations

, , +7

Random walks, universal traversal sequences, and the complexity of maze problems

Romas Aleliunas, Richard M. Karp, Richard J. Lipton et al. · 1979 · 705 citations

, , +15

Bounded-width polynomial-size branching programs recognize exactly those languages in <i>NC</i><sup>1</sup>

David A. Mix Barrington · 1986 · 686 citations

, , +6