19 search results - page 1 / 4 » Strong Reductions and Isomorphism of Complete Sets |
FSTTCS
2007
Springer
14 years 2 months ago
2007
Springer
We study the structure of the polynomial-time complete sets for NP and PSPACE under strong nondeterministic polynomial-time reductions (SNP-reductions). We show the following resu...
JCSS
1998
13 years 8 months ago
1998
We show that all sets that are complete for NP under non-uniform AC0 reductions are isomorphic under non-uniform AC0-computable isomorphisms. Furthermore, these sets remain NP-com...
AML
2005
13 years 8 months ago
2005
A strong reducibility relation between partial numberings is introduced which is such that the reduction function transfers exactly the numbers which are indices under the numberin...
JCSS
2011
13 years 3 months ago
2011
For any class C closed under TC0 reductions, and for any measure u of uniformity containing Dlogtime, it is shown that all sets complete for C under u-uniform AC0 reductions are i...
IPL
2002
13 years 8 months ago
2002
It is shown that for any class C closed under linear-time reductions, the complete sets for C under sublogarithmic reductions are also complete under 2DFA reductions, and thus are...