Symbolic Logic and Mechanical Theorem Proving
Symbolic Logic and Mechanical Theorem Proving
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
An observation on time-storage trade off
STOC '73 Proceedings of the fifth 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
Formal languages and their relation to automata
Formal languages and their relation to automata
On Equivalence and Containment Problems for Formal Languages
Journal of the ACM (JACM)
Log Space Recognition and Translation of Parenthesis Languages
Journal of the ACM (JACM)
Even simple programs are hard to analyze
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Complexity of finitely presented algebras
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
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
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Nondeterminism and the size of two way finite automata
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A quantifier characterization for nondeterministic log space
ACM SIGACT News
The circuit value problem is log space complete for P
ACM SIGACT News
Journal of Computer and System Sciences
Alternation as a programming paradigm
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Storage requirements for deterministic polynomialtime recognizable languages
Journal of Computer and System Sciences
Parallel computation: models and complexity issues
Algorithms and theory of computation handbook
Logical foundations of RDF(S) with datatypes
Journal of Artificial Intelligence Research
Tight bounds for monotone switching networks via fourier analysis
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Parameterized verification of asynchronous shared-memory systems
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
| Hi-index | 0.00 |
The results of Cook and Karp ([K], [C]) aroused considerable interest for at least two reasons. First, the answer to a long-standing open question which had seemed peculiar to automata theory—whether deterministic and nondeterministic polynomial-time-bounded Turing machines are equivalent in power—was seen to be exactly equivalent to determining whether any of several familiar combinatorial problems can be solved by polynomial-time algorithms. Second, the existence of complete problems for NP1 made it possible to replace an entire class of questions by a question about a single representative.Thus all of these combinatorial and automata-theoretic problems were essentially restatements of a single problem, such as: can satisfiability of a propositional formula be decided in polynomial time. The main purpose of this paper is to introduce several problems which are complete for P, the class of languages recognizable in deterministic polynomial time. Any such language has the property that if it is recognizable in space logk(•), then every language in P is so recognizable. Thus a problem complete for P will serve to differentiate those sets in P which are not recognizable in logarithmic space from those which are, providing such differentiation is possible. A problem of this type was first presented by Cook in [C2], concerning solvable path systems.