Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
Characterizations of flowchartable recursions short version
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Path systems and language recognition
STOC '70 Proceedings of the second annual ACM symposium on Theory of computing
Time-Space trade-offs for some algebraic problems
Journal of the ACM (JACM)
A separator theorem for graphs with an excluded minor and its applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
I/O Overhead and Parallel VLSI Architectures for Lattice Computations
IEEE Transactions on Computers
Journal of the ACM (JACM)
Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game
Journal of the ACM (JACM)
An overview of computational complexity
Communications of the ACM
Space bounds for a game on graphs
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
On the complexity of grammar and related problems
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Storage requirements for deterministic / polynomial time recognizable languages
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Complete problems for deterministic polynomial time
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
A characterization of the power of vector machines
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
The pebbling problem is complete in polynomial space
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Upper and lower bounds on time-space tradeoffs
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Time-space tradeoffs for some algebraic problems
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
The circuit value problem is log space complete for P
ACM SIGACT News
An overview of computational complexity
ACM Turing award lectures
Hi-index | 0.03 |
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.