Complete problems for deterministic polynomial time
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Record of the Project MAC conference on concurrent systems and parallel computation
Serial compilation and the 1401 FORTRAN compiler
IBM Systems Journal
Memory bounds for recognition of context-free and context-sensitive languages
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Characterizations of flowchartable recursions
Journal of Computer and System Sciences
Journal of Computer and System Sciences
An observation on time-storage trade off
Journal of Computer and System Sciences
Computing Optimal Linear Layouts of Trees in Linear Time
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Universal algebra and hardness results for constraint satisfaction problems
Theoretical Computer Science
The PSPACE-Completeness of Black-White Pebbling
SIAM Journal on Computing
Pebbles and Branching Programs for Tree Evaluation
ACM Transactions on Computation Theory (TOCT)
On the Relative Strength of Pebbling and Resolution
ACM Transactions on Computational Logic (TOCL)
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Near Unanimity Constraints Have Bounded Pathwidth Duality
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Game characterizations and the PSPACE-completeness of tree resolution space
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
API compilation for image hardware accelerators
ACM Transactions on Architecture and Code Optimization (TACO) - Special Issue on High-Performance Embedded Architectures and Compilers
Some trade-off results for polynomial calculus: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
An intriguing question is whether (log n)^2 space is enough to recognize the class of languages recognizable in deterministic polynomial time. This question has earlier been narrowed down to the storage required to recognize a particular language called SP. SP is clearly in and it has been shown that if SP has tape complexity (log n)^k, then every member of has tape complexity (log n)^k. This paper presents further evidence in support of the conjecture that SP cannot be recognized using storage (log n)^k for any k. We have no techniques at present for proving such a statement for Turing machines in general; we prove the result for a suitably restricted device.