Deterministic CFL's are accepted simultaneously in polynomial time and log squared space

Authors:
Stephen A. Cook
Affiliations:
-
Venue:
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Year:
1979

Citing 3
Cited 16

On the Tape Complexity of Deterministic Context-Free Languages

Journal of the ACM (JACM)
On time-space classes and their relation to the theory of real addition

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The circuit value problem is log space complete for P

ACM SIGACT News

A complexity theory based on Boolean algebra

Journal of the ACM (JACM)
The Boolean formula value problem is in ALOGTIME

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A bibliography on parallel parsing

ACM SIGPLAN Notices
Parallel RAMs with owned global memory and deterministic context-free language recognition

Journal of the ACM (JACM)
Bounded size dictionary compression: SCk -completeness and NC algorithms

Information and Computation
Bandwidth constrained NP-Complete problems

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A time-space tradeoff for sorting on a general sequential model of computation

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Two familiar transitive closure algorithms which admit no polynomial time, sublinear space implementations

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
The random access hierarchy

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Arithmetizing classes around NC1and L

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Circuits and context-free languages

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Parallel computation: models and complexity issues

Algorithms and theory of computation handbook
The lower reaches of circuit uniformity

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
COMPLEXITY AND STRUCTURE IN FORMAL LANGUAGE THEORY

Fundamenta Informaticae
Streaming algorithms for language recognition problems

Theoretical Computer Science
Resource Trade-offs in Syntactically Multilinear Arithmetic Circuits

Computational Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose to prove the theorem in the title. Let PLOSS be the class of sets recognizable on a deterministic Turing machine simultaneously in polynomial time and log squared space. Using the notation of Bruss and Meyer [1], PLOSS &equil; &ugr;k TISP(nk,k log2n).