On isomorphisms and density of NP and other complete sets

If all NP complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) then P @@@@ NP and if all PTAPE complete sets are p-isomorphic then P @@@@ PTAPE. We show that all NP complete sets known (in the literature) are indeed p-isomorphic and so are the known PTAPE complete sets. Thus showing that, inspite of the radically different origins and attempted simplification of these sets, all the known NP complete sets are identical but for polynomially time bounded permutations. Furthermore, if all NP complete sets are p-isomorphic then they all must have similar densities and, for example, no language over a single letter alphabet can be NP complete, nor can any sparse language over an arbitrary alphabet be NP complete. We show that complete sets in EXPTIME and EXPTAPE cannot be sparse and therefore they cannot be over a single letter alphabet. Similarly, we show that the hardest context-sensitive languages cannot be sparse. We also relate the existence of sparse complete sets to the existence of simple combinatorial circuits for the corresponding truncated recognition problem of these languages.

[1]  I. Mazin,et al.  Theory , 1934 .

[2]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[3]  Sartaj Sahni.  Some Related Problems from Network Flows, Game Theory and Integer Programming , 1972, SWAT.

[4]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[5]  Sheila A. Greibach,et al.  The Hardest Context-Free Language , 1973, SIAM J. Comput..

[6]  Harry B. Hunt,et al.  The LBA Problem and its Importance in the Theory of Computing , 1973 .

[7]  Jeffrey D. Ullman,et al.  Polynomial complete scheduling problems , 1973, SOSP '73.

[8]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[9]  David S. Johnson,et al.  Some simplified NP-complete problems , 1974, STOC '74.

[10]  Juris Hartmanis,et al.  On the Structure of Feasible Computation , 1974 .

[11]  David S. Johnson,et al.  Some simplified polynomial complete problems , 1974 .

[12]  Leslie G. Valiant,et al.  On time versus space and related problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[13]  Janos Simon.  On some central problems in computational complexity , 1975 .

[14]  Z. Galil.  The Complexity of Resolution Procedures for Theorem Proving in the Propositional Calculus , 1975 .

[15]  Juris Hartmanis,et al.  On the Structure of Feasible Computations , 1976, Adv. Comput..

[16]  Robert E. Tarjan,et al.  A Combinatorial Problem Which Is Complete in Polynomial Space , 1976, JACM.

[17]  Robert M. Solovay.  On Sets Cook-Reducible to Sparse Sets , 1976, SIAM J. Comput..