@inproceedings{21168ccbd32e4a37a2f8fe6eb768a876,
title = "Nondeterministic linear-time tasks may require substantially nonlinear deterministic time in the case of sublinear work space",
abstract = "Log-size Parabolic Clique Problem is a version of Clique Problem solvable in linear time by a log-space nondeterministic Turing machine. However, no deterministic machine (in a very general sense of this term) with sequential-access read-only input tape and work space nσ solves Log-size Parabolic Clique Problem within time n1+τ if σ + 2τ < 1/2.",
author = "Yuri Gurevich and Saharon Shelah",
year = "1988",
doi = "10.1145/62212.62239",
language = "אנגלית",
isbn = "0897912640",
series = "Proceedings of the Annual ACM Symposium on Theory of Computing",
publisher = "Association for Computing Machinery",
pages = "281--289",
booktitle = "Proceedings of the 20th Annual ACM Symposium on Theory of Computing, STOC 1988",
note = "20th Annual ACM Symposium on Theory of Computing, STOC 1988 ; Conference date: 02-05-1988 Through 04-05-1988",
}