Reducing the complexity of reductions

Authors:
Manindra Agrawal;Eric Allender;Russell Impagliazzo;Toniann Pitassi;Steven Rudich
Affiliations:
Dept. of Computer Science, Indian Institute of Technology;Dept. of Computer Science, Rutgers University;Dept. of Computer Science, UCSD;Dept. of Computer Science, University of Arizona;Dept. of Computer Science, Carnegie Mellon University
Venue:
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Year:
1997

One-way permutations in NC0

Information Processing Letters
On one-way functions and polynomial-time isomorphisms

Theoretical Computer Science
Structural complexity 1

Structural complexity 1
P-uniform circuit complexity

Journal of the ACM (JACM)
On uniformity within NC1

Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Using hard problems to create pseudorandom generators

Using hard problems to create pseudorandom generators
The isomorphism conjecture fails relative to a random oracle

Journal of the ACM (JACM)
A First-Order Isomorphism Theorem

SIAM Journal on Computing
An Isomorphism Theorem for Circuit Complexity

CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
DSPACE(n)=?NSPACE(n): a degree theoretic characterization

SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)

The First-Order Isomorphism Theorem

FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science

Hi-index	0.00