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 shown that: 1. Relative to reductions computed by one-way logspace DTMs, both the conjectures are false. 2. Relative to reductions computed by one-way logspace NTMs, the isomorphism conjecture is true. 3. Relative to reductions computed by one-way, multi-head, oblivious logspace DTMs, the encrypted complete set conjecture is false. 4. Relative to red...
AbstractThe isomorphism conjecture is investigated for exponential-time and other complexity classes...
AbstractIn this note we show that the recently discovered NP complete sets arising in number theory,...
IN this note we show that the recently discovered NP complete sets arising in number theory, the PT...
The isomorphism conjecture states that all NP-complete sets are polynomial-time isomorphic while the...
AbstractAccording to the isomorphism conjecture all NP-complete sets are polynomial?time isomorphic ...
According to the isomorphism conjecture all NP-complete sets are polynomial-time isomorphic to each ...
If all NP complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) ...
In this paper we demonstrate an oracle relative to which there are one-way functions but every padd...
Let C be any complexity class closed under log-lin reductions. We show that all sets complete for C ...
In this note we show that if the satisfiability of Boolean formulas of low Kolmogorov complexity ca...
AbstractLet C be any complexity class closed under log-lin reductions. We show that all sets complet...
AbstractWe show, for example, the following claim: if EXPSPACE (def DSPACE(2poly) has a non-p-isomo...
AbstractA set A is polynomial many-one reducible to a set B (A is Karp-reducible to B) if there is a...
The degree structure of complete sets under 2DFA reductions is investigated. It is shown that, for a...
We build on the recent progress regarding isomorphisms of complete sets that was reported in Agrawal...
AbstractThe isomorphism conjecture is investigated for exponential-time and other complexity classes...
AbstractIn this note we show that the recently discovered NP complete sets arising in number theory,...
IN this note we show that the recently discovered NP complete sets arising in number theory, the PT...
The isomorphism conjecture states that all NP-complete sets are polynomial-time isomorphic while the...
AbstractAccording to the isomorphism conjecture all NP-complete sets are polynomial?time isomorphic ...
According to the isomorphism conjecture all NP-complete sets are polynomial-time isomorphic to each ...
If all NP complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) ...
In this paper we demonstrate an oracle relative to which there are one-way functions but every padd...
Let C be any complexity class closed under log-lin reductions. We show that all sets complete for C ...
In this note we show that if the satisfiability of Boolean formulas of low Kolmogorov complexity ca...
AbstractLet C be any complexity class closed under log-lin reductions. We show that all sets complet...
AbstractWe show, for example, the following claim: if EXPSPACE (def DSPACE(2poly) has a non-p-isomo...
AbstractA set A is polynomial many-one reducible to a set B (A is Karp-reducible to B) if there is a...
The degree structure of complete sets under 2DFA reductions is investigated. It is shown that, for a...
We build on the recent progress regarding isomorphisms of complete sets that was reported in Agrawal...
AbstractThe isomorphism conjecture is investigated for exponential-time and other complexity classes...
AbstractIn this note we show that the recently discovered NP complete sets arising in number theory,...
IN this note we show that the recently discovered NP complete sets arising in number theory, the PT...