On the Isomorphism Conjecture for Weak Reducibilities
نویسندگان
چکیده
منابع مشابه
On the Isomorphism Conjecture for Weak Reducibilities
According to the isomorphism conjecture all NP-complete sets are polynomial-time isomorphic to each other while according to the encrypted complete set conjecture there is a p-one-way function f and an NP-complete set A such that A and f(A) are not polynomialtime isomorphic to each other. In this paper, these two conjectures are investigated for reducibilities weaker than polynomial-time. It is...
متن کاملThe Isomorphism Conjecture for NP
In this article, we survey the arguments and known results for and against the Isomorphism Conjecture.
متن کاملNontriviality for Exponential Time w.r.t. Weak Reducibilities
A set A is nontrivial for the linear exponential time class E = DTIME(2) if A ∈ E and the sets from E which can be reduced to A are not from a single level DTIME(2) of the linear exponential hierarchy. Similarly, a set A is nontrivial for the polynomial exponential time class EXP = DTIME(2) if A ∈ EXP and the sets from EXP which can be reduced to A are not from a single level DTIME(2 k ) of the...
متن کاملThe isomorphism conjecture for constant depth reductions
For any class C closed under TC reductions, and for any measure u of uniformity containing Dlogtime, it is shown that all sets complete for C under u-uniform AC reductions are isomorphic under u-uniform AC-computable isomorphisms.
متن کاملOn the Isomorphism Conjecture for 2-DFA Reductions
The degree structure of complete sets under 2DFA reductions is investigated. It is shown that, for any class C that is closed under log-lin reductions: • All complete sets for the class C under 2DFA reductions are also complete under one-one, length-increasing 2DFA reductions and are first-order isomorphic. • The 2DFA-isomorphism conjecture is false, i.e., the complete sets under 2DFA reduction...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1996
ISSN: 0022-0000
DOI: 10.1006/jcss.1996.0068