The isomorphism conjecture for constant depth reductions

Authors:
Manindra Agrawal
Affiliations:
Department of Computer Science, IIT Kanpur, Kanpur 208016, India
Venue:
Journal of Computer and System Sciences
Year:
2011

Citing 17
Cited 2

Almost optimal lower bounds for small depth circuits

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Languages that capture complexity classes

SIAM Journal on Computing
On uniformity within NC1

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

SIAM Journal on Computing
Hardness vs randomness

Journal of Computer and System Sciences
The isomorphism conjecture fails relative to a random oracle

Journal of the ACM (JACM)
The complexity of iterated multiplication

Information and Computation
The Isomorphism Conjecture Holds Relative toan Oracle

SIAM Journal on Computing
On the isomorphism conjecture for weak reducibilities

Journal of Computer and System Sciences
A First-Order Isomorphism Theorem

SIAM Journal on 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
Reducing the complexity of reductions

Computational Complexity
The First-Order Isomorphism Theorem

FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Constant depth circuits and the Lutz hypothesis

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations 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
Space-bounded reducibility among combinatorial problems

Journal of Computer and System Sciences

Verifying proofs in constant depth

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Verifying proofs in constant depth

ACM Transactions on Computation Theory (TOCT)

Quantified Score

Hi-index	0.00

Visualization

Abstract

For any class C closed under TC^0 reductions, and for any measure u of uniformity containing Dlogtime, it is shown that all sets complete for C under u-uniform AC^0 reductions are isomorphic under u-uniform AC^0-computable isomorphisms.