On some direct encodings of nondeterministic Turing machines operating in polynomial time into p-complete problems

Authors:
Zvi Galil
Affiliations:
Cornell University
Venue:
ACM SIGACT News
Year:
1974

Citing 2
Cited 0

The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The equivalence problem for regular expressions with squaring requires exponential space

SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cook [1] and Karp [2] introduced the notion of complete problems. Meyer and Stockmeyer [3] showed that some problems require exponential time. All these problems have a common property which in the latter case implies that they cannot be solved in polynomial time.