Reducing the complexity of reductions

Computational Complexity

Volumn 10, Issue 2, 2001, Pages 117-138

  Agrawal, Manindra ^a   Allender, Eric ^b   Impagliazzo, Russell ^c   Pitassi, Toniann ^d   Rudich, Steven ^e  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^b RUTGERS UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

^d UNIVERSITY OF TORONTO   (Canada)

^e Carnegie Mellon University   (United States)

Author keywords

Berman Hartmanis conjecture; Completeness; Constant depth circuits; Isomorphisms; Powering in finite fields

Indexed keywords

EID: 0035568114     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00037-001-8191-1     Document Type: Article

References (19)

1. M. AGRAWAL (2001a). The first-order isomorphism theorem. In Proc. 21st Foundations of Software Technology and Theoretical Computer Science Conference (FST&TCS), Lecture Notes in Comput. Sci., Springer, to appear.
2. 0-isomorphisms. In Proc. 16th IEEE Conference on Computational Complexity, 13-20.
3. M. AGRAWAL, E. ALLENDER & S. RUDICH (1998). Reductions in circuit complexity: An isomorphism theorem and a gap theorem. J. Comput. System Sci. 57, 127-143.
4. 1 formulae on finite structures. Ann. Pure Appl. Logic 24, 1-48.
5. E. ALLENDER (1989). P-uniform circuit complexity. J. Assoc. Comput. Mach. 36, 912-928.
6. E. ALLENDER & V. GORE (1991). Rudimentary reductions revisited. Inform. Process. Lett. 40, 89-95.
7. N. ALON & J. SPENCER (1992). The Probabilistic Method. Wiley.
8. J. BALCÁZAR, J. DÍAZ & J. GABARRÓ (1995, 1990). Structural Complexity Theory I and II. Springer.
9. 1. J. Comput. System Sci. 41, 274-306.
10. L. BERMAN & J. HARTMANIS (1977). On isomorphism and density of NP and other complete sets. SIAM J. Comput. 6, 305-322.
11. W. EBERLY (1989). Very fast parallel polynomial arithmetic. SIAM J. Comput. 18, 955-976.
12. G. FRANDSEN, M. VALENCE & D. M. BARRINGTON (1994). Some results on uniform arithmetic circuit complexity. Math. Systems Theory 27, 105-124.
13. M. FURST, J. B. SAXE & M. SIPSER (1984). Parity, circuits, and the polynomial-time hierarchy. Math. Systems Theory 17, 13-27.
14. 0. Inform. Process. Lett. 26, 153-155.
15. 0. In Proc. Twenty-Eighth International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Comput. Sci. 2076, Springer, 104-114.
16. N. IMMERMAN (1998). Descriptive Complexity. Graduate Texts in Computer Sci., Springer.
17. N. D. JONES (1975). Space-bounded reducibility among combinatorial problems. J. Comput. System Sci. 11, 68-85.
18. S. LINDELL (1992). A purely logical characterization of circuit uniformity. In Proc. 7th IEEE Conference on Structure in Complexity Theory, 185-192.
19. H. VEITH (1998). Succinct representation, leaf languages, and projection reductions. Inform. and Comput. 142, 207-236.