Towards uniform AC0-isomorphisms

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2001, Pages 13-20

  Agrawal, M ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; POLYNOMIAL APPROXIMATION; SET THEORY; THEOREM PROVING; TIME SERIES ANALYSIS;

COMPUTABLE ISOMORPHISMS; LOGSPACE UNIFORM;

COMPUTATIONAL COMPLEXITY;

EID: 0034871618     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Reducing the complexity of reductions
2. Reductions in circuit complexity: An isomorphism theorem and a gap theorem
3. P-uniform circuit complexity
4. A first-order isomorphism theorem
5. Rudimentary reductions revisited
6. Simple constructions of almost k-wise independent random variables
7. 1
8. On isomorphism and density of NP and other complete sets
9. Constant depth circuits and the Lutz hypothesis
10. Intersection theorems for systems of sets
11. Parity, circuits, and the polynomial hierarchy
12. Computational limitations on small depth circuits
13. Space-bounded reducibility among combinatorial problems
14. A purely logical characterization of circuit complexity
15. Small-bias probability spaces: Efficient constructions and applications
16. Hardness vs. randomness
17. 0