Stephen A. Cook
ABSTRACT
Recently there have been several attempts to prove that every set of strings in @@@@ (i.e., recognizable in deterministic polynomial time) can be recognized in deterministic storage (log n)2. The methods used in the attempts were based on that of [1], in which it is shown that every context free language can be accepted in storage (log n)2 Our thesis in the present paper is that these attempts must fail. We define a specific set SP of strings which is clearly in @@@@, but in a certain well-defined sense cannot be recognized in storage (log n)2 using the techniques in [1]. We conjecture that no Turing machine recognizes SP within storage (log n)2, and show that if this conjecture is false, then in fact every member of @@@@ can be recognized within storage (log n)2.
- 1.P. M. Lewis II, R. E. Stearns, and J. Hartmanis, "Memory Bounds for the Recognition of Context-Free and Context Sensitive Languages". IEEE Conference Record on 1965 Symposium on Switching Circuit Theory and Logical Design.Google Scholar
- 2.S. A. Cook, Path Systems and Language Recognition. Proceedings Second Annual Symposium on the Theory of Computation, May 1970, pp. 70-72. Google ScholarDigital Library
- 3.S. A. Cook, "The Complexity of Theorem-Proving Procedures", Proceedings of Third Annual ACM Symposium on Theory of Computing, pp. 151-158. Google ScholarDigital Library
- 4.S. A. Cook, Characterizations of Pushdown Machines in Terms of Time-Bounded Computers. J.A.C.M. Vol. 18, No. 1, Jan. 1971, pp. 4-18. Google ScholarDigital Library
- 5.M. S. Paterson and C. E. Hewitt, "Comparative Schematology", Record of Project MAC Conference on Concurrent Systems and Parallel Computation (June, 1970), 119-128, ACM, New Jersey (December, 1970).Google Scholar
- 6.S. A. Walker and H. R. Strong, "Characterizations of Flowchartable Recursions" Short Version, Proceedings of Fourth Annual ACM Symposium on Theory of Computing, May, 1972, pp. 18-34. Google ScholarDigital Library
Index Terms
- An observation on time-storage trade off
Recommendations
Time-space trade-offs for predecessor search
STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of ComputingWe develop a new technique for proving cell-probe lower bounds for static data structures. Previous lower bounds used a reduction to communication games, which was known not to be tight by counting arguments. We give the first lower bound for an ...
Optimal time-space trade-offs for non-comparison-based sorting
SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithmsWe study the problem of sorting n integers of w bits on a unit-cost RAM with word size w, and in particular consider the time-space trade-off (product of time and space in bits) for this problem. For comparison-based algorithms, the time-space ...
An observation on time-storage trade off
There are two main results proved here. The first states that a certain set SP of strings (those coding ''solvable path systems'') has tape complexity (log n)^2 iff every set in (i.e., of deterministic polynomial time complexity) has tape complexity (...
Comments