论文信息 - Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space

Nondeterministic Linear-Time Tasks May Require Substantially Nonlinear Deterministic Time in the Case of Sublinear Work Space

Log-size Parabolic Clique Problem is a version of Clique Problem solvable in linear time by a log-space nondeterministic Turning machine. However, no deterministic machine (in a very general sense of this term) with sequential-access read-only input tape and work space n s solves Log-size Parabolic Clique Problem within time n 1 + τ if s + 2τ

Saharon Shelah | Yuri Gurevich

[1] Allan Borodin,et al. A Time-Space Tradeoff for Element Distinctness , 1987, SIAM J. Comput..

[2] Zvi Galil,et al. A Time-Space Tradeoff for Language Recognition , 1981, FOCS.

[3] Béla Bollobás,et al. Random Graphs , 1985 .

[4] Endre Szemerédi,et al. On determinism versus non-determinism and related problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).