Title :
Isomorphisms of NP complete problems on random instances
Author :
Belanger, Jay ; Wang, Jie
Author_Institution :
Dept. of Math. & Comput. Sci., Wilkes Univ., Wilkes-Barre, PA, USA
Abstract :
Polynomial isomorphisms are defined for NP-complete sets on random instances. Not only are polynomial-time computable and invertible bijections among complete sets considered, but also it is required that these bijections preserve distributions on random instances of these sets. Sufficient conditions for randomized decision problems to be polynomially isomorphic are shown. It is then proved that all the known average-case NP-complete problems under many-one reductions are polynomially isomorphic. These problems include the randomized tiling problem, the randomized halting problem, the randomized Post correspondence problem, and the randomized word problem for Thue systems
Keywords :
computational complexity; rewriting systems; NP complete problems; Thue systems; invertible bijections; many-one reductions; polynomial isomorphisms; random instances; randomized Post correspondence problem; randomized decision problems; randomized halting problem; randomized tiling problem; randomized word problem; Complexity theory; Computer science; Distributed computing; Internet; NP-complete problem; Polynomials; Probability distribution;
Conference_Titel :
Structure in Complexity Theory Conference, 1993., Proceedings of the Eighth Annual
Conference_Location :
San Diego, CA
Print_ISBN :
0-8186-4070-7
DOI :
10.1109/SCT.1993.336540
