We show that all NP complete sets known (in the literature) are indeed p-isomorphic and so are the known PTAPE complete sets.

If all NP complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) then PNP and if all. PTAPE Complete sets are p-isomorphic ...

If all N P complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) then P ≠ N P and if all PTAPE complete sets are ...

Furthermore, if all NP complete sets are p-isomorphic then theyall must have similar densities and, for example, no language over a single letter alphabet ...

In this paper we show that regardless of their origins and attempted simplifications, all the "known" NP com- plete sets are essentially the same set. ~re ...

It is shown that complete sets in EXPTIME and EXPTAPE cannot be sparse and therefore they cannot be over a single letter alphabet, and the hardest ...

If all NP complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) then P $\neq$ NP and if all PTAPE complete sets are ...

We show that all $NP$ complete sets known (in the literature) are indeed $p$-isomorphic and so are the known PTAPE complete sets.

Abstract: If all N P complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) then P ≠ N P and if all PTAPE complete sets are P ...

Berman, L., Hartmanis, J. (1977) On Isomorphisms and Density of $NP$ and Other Complete Sets. SIAM Journal on Computing, 6 (2). 305-322 doi:10.1137/0206023.