Title :
Polynomial isomorphism of 1-L-complete sets
Author :
Agrawal, Manindra ; Biswas, Somenath
Author_Institution :
Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kanpur, India
Abstract :
Let C be any complexity class closed under log-lin reductions. It is shown that all complete sets for C under 1-L reductions are polynomial time isomorphic to one other. It is indicated how to generalize the result to reductions computed by finite-crossing machines
Keywords :
computational complexity; 1-L reductions; 1-L-complete sets; complexity class; finite-crossing machines; log-lin reductions; polynomial isomorphism; Complexity theory; Computer science; Encoding; Polynomials;
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.336539
