Add to ORKGIN this note we show that the recently discovered NP complete sets arising in number theory, the PTAPE complete sets arising in game theory and EXPTAPE complete sets arising from algebraic word problems are polynomial time isomorphic to the previously known complete sets in the corresponding categories
AbstractWe show the following results regarding complete sets.•NP-complete sets and PSPACE-complete ...
AbstractNew proofs of two properties of the polynomial-time hierarchy are given. The classes in the ...
AbstractTwo sets A and B are one-one polynomial time equivalent (one-one p-equivalent) if there are ...
AbstractIn this note we show that the recently discovered NP complete sets arising in number theory,...
If all NP complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) ...
Hartmanis and Berman have conjectured that all NP-complete sets are polynomial time isomorphic. A c...
In this note we show that if the satisfiability of Boolean formulas of low Kolmogorov complexity ca...
AbstractAccording to the isomorphism conjecture all NP-complete sets are polynomial?time isomorphic ...
AbstractLet C be any complexity class closed under log-lin reductions. We show that all sets complet...
According to the isomorphism conjecture all NP-complete sets are polynomial-time isomorphic to each ...
AbstractWe present two results about witness functions for sets in NP and coNP. First, any set that ...
The isomorphism conjecture states that all NP-complete sets are polynomial-time isomorphic while the...
AbstractIt is shown that if one-way functions exist, then there are sets A and B such that A and B a...
Let C be any complexity class closed under log-lin reductions. It is shown that all complete sets fo...
A simple technique is developed for manipulating the relative complexity of sets with respect to pol...
AbstractWe show the following results regarding complete sets.•NP-complete sets and PSPACE-complete ...
AbstractNew proofs of two properties of the polynomial-time hierarchy are given. The classes in the ...
AbstractTwo sets A and B are one-one polynomial time equivalent (one-one p-equivalent) if there are ...
AbstractIn this note we show that the recently discovered NP complete sets arising in number theory,...
If all NP complete sets are isomorphic under deterministic polynomial time mappings (p-isomorphic) ...
Hartmanis and Berman have conjectured that all NP-complete sets are polynomial time isomorphic. A c...
In this note we show that if the satisfiability of Boolean formulas of low Kolmogorov complexity ca...
AbstractAccording to the isomorphism conjecture all NP-complete sets are polynomial?time isomorphic ...
AbstractLet C be any complexity class closed under log-lin reductions. We show that all sets complet...
According to the isomorphism conjecture all NP-complete sets are polynomial-time isomorphic to each ...
AbstractWe present two results about witness functions for sets in NP and coNP. First, any set that ...
The isomorphism conjecture states that all NP-complete sets are polynomial-time isomorphic while the...
AbstractIt is shown that if one-way functions exist, then there are sets A and B such that A and B a...
Let C be any complexity class closed under log-lin reductions. It is shown that all complete sets fo...
A simple technique is developed for manipulating the relative complexity of sets with respect to pol...
AbstractWe show the following results regarding complete sets.•NP-complete sets and PSPACE-complete ...
AbstractNew proofs of two properties of the polynomial-time hierarchy are given. The classes in the ...
AbstractTwo sets A and B are one-one polynomial time equivalent (one-one p-equivalent) if there are ...