Isomorphisms and 1-L reductions
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Almost everywhere high nonuniform complexity
Journal of Computer and System Sciences
Theoretical Computer Science
A First-Order Isomorphism Theorem
SIAM Journal on Computing
Resource bounded randomness and weakly complete problems
Theoretical Computer Science
The quantitative structure of exponential time
Complexity theory retrospective II
Reductions in circuit complexity: an isomorphism theorem and a gap theorem
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Some pointed questions concerning asymptotic lower bounds, and news from the isomorphism front
Current trends in theoretical computer science
Twelve problems in resource-bounded measure
Current trends in theoretical computer science
Reducing the complexity of reductions
Computational Complexity
The Law of the Iterated Logarithm for p-Random Sequences
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Reducibility, randomness, and intractibility (Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Towards Uniform AC0 -Isomorphisms
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Pseudo-Random Generators and Structure of Complete Degrees
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Polynomial reducibilities and complete sets.
Polynomial reducibilities and complete sets.
The cpa's responsibility for the prevention and detection of computer fraud.
The cpa's responsibility for the prevention and detection of computer fraud.
Comparing reductions to NP-complete sets
Information and Computation
| Hi-index | 0.00 |
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 results. -- If NP contains a p-random language, then all polynomial-time complete sets for PSPACE are SNP-isomorphic. -- If NP ∩ co-NP contains a p-random language, then all polynomial-time complete sets for NP are SNP-isomorphic.