Abstract
Let Σ be an arbitrary alphabet.
denotes ɛ∪Σ∪...∪Σn. We say that a function t, t :
is f-sparse iff card
for every natural n. The main theorem of this paper establishes that if CLIQUE has some f-sparse translation into another set, which is calculable by a deterministic Turing machine in time bounded by f, then all the sets belonging to NP are calculable in time bounded by a function polynomially related to f. The proof is constructive and shows the way of constructing a proper algorithm. The simplest and most significant corollary says that if there is an NP-complete language over a single letter alphabet, then P=NP.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Preview
Unable to display preview. Download preview PDF.
References
J.Hartmanis, L.Berman: On isomorphisms and density of NP and other complete sets. Proc. Eight ACM Sym. Theory of Computing, 30–40 (1976).
R.Book, C.Wrathhall, A.Selman and D.Dobkin: Inclusion Complete Tally Languages and Hartmanis-Berman Conjecture (1977).
A.V.Aho, J.E.Hopcroft and J.D.Ullman: The Design and Analysis of Computer Algorithms, Addison-Wesley Publishing Company, Readin, Mass., 1074.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berman, P. (1978). Relationship between density and deterministic complexity of MP-complete languages. In: Ausiello, G., Böhm, C. (eds) Automata, Languages and Programming. ICALP 1978. Lecture Notes in Computer Science, vol 62. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08860-1_6
Download citation
DOI: https://doi.org/10.1007/3-540-08860-1_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08860-8
Online ISBN: 978-3-540-35807-7
eBook Packages: Springer Book Archive