Languages that capture complexity classes
SIAM Journal on Computing
Structural complexity 1
The ismorphism conjecture fails relative to a random oracle
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
The complexity of iterated multiplication
Information and Computation
On the isomorphism conjecture for weak reducibilities
Journal of Computer and System Sciences
Reducing the complexity of reductions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
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
A First-Order Isomorphism Theorem
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Borel sets and circuit complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Towards Uniform AC0 -Isomorphisms
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Simple construction of almost k-wise independent random variables
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
The isomorphism conjecture holds relative to an oracle
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Space-bounded reducibility among combinatorial problems
Journal of Computer and System Sciences
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
The isomorphism conjecture for constant depth reductions
Journal of Computer and System Sciences
The complexity of satisfiability problems: refining Schaefer's theorem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
For any class C und closed under NC1 reductions, it is shown that all sets complete for C under first-order (equivalently, Dlogtime-uniform AC0) reductions are isomorphic under first-order computable isomorphisms.