The first-order isomorphism theorem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2245, Issue , 2001, Pages 70-82

  Agrawal, Manindra ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

[No Author keywords available]

Indexed keywords

SET THEORY; SOFTWARE ENGINEERING;

FIRST ORDER;

C (PROGRAMMING LANGUAGE);

EID: 84944060916     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45294-x_7     Document Type: Conference Paper

References (23)

1. M. Agrawal, E. Allender, R. Impagliazzio, T. Pitassi, and S. Rudich. Reducing the complexity of reductions. In Proceedings of Annual ACM Symposium on the Theory of Computing, pages 730–738, 1997.
2. M. Agrawal, E. Allender, and S. Rudich. Reductions in circuit complexity: An isomorphism theorem and a gap theorem. J. Comput. Sys. Sci., 57:127–143, 1998.
3. E. Allender, J. Balc´azar, and N. Immerman. A first-order isomorphism theorem. In Proceedings of the Symposium on Theoretical Aspects of Computer Science, 1993.
4. E. Allender and V. Gore. Rudimentary reductions revisited. Information Processing Letters, 40:89–95, 1991.
5. N. Alon, O. Goldreich, J. Hastad, and R. Peralta. Simple constructions of almost k-wise independent random variables. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science, pages 544–553, 1990.
6. M. Agrawal. On the isomorphism problem for weak reducibilities. J. Comput. Sys. Sci., 53(2):267–282, 1996.
7. M. Agrawal. Towards uniform AC0 isomorphisms. In Proceedings of the Conference on Computational Complexity, 2001. to be presented.
8. J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1988.
9. L. Berman and J. Hartmanis. On isomorphism and density of NP and other complete sets. SIAM Journal on Computing, 1:305–322, 1977.
10. D. Barrington, N. Immerman, and H. Straubing. On uniformity within NC1. J. Comput. Sys. Sci., 74:274–306, 1990.
11. A. Chandra, L. Stockmeyer, and U. Vishkin. Constant depth reducibility. SIAM Journal on Computing, 13:423–439, 1984.
12. P. Erdös and R. Rado. Intersection theorems for systems of sets. J. London Math. Soc., 35:85–90, 1960.
13. S. Fenner, L. Fortnow, and S. Kurtz. The isomorphism conjecture holds relative to an oracle. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science, pages 30–39, 1992. To appear in SIAM J. Comput.
14. M. Furst, J. Saxe, and M. Sipser. Parity, circuits, and the polynomial hierarchy. Mathematical Systems Theory, 17:13–27, 1984.
15. N. Immerman and S. Landau. The complexity of iterated multiplication. Information and Computation, 116:103–116, 1995.
16. N. Immerman. Languages that capture complexity classes. SIAM Journal on Computing, 16:760–778, 1987.
17. N. Jones. Space-bounded reducibility among combinatorial problems. J. Comput. Sys. Sci., 11:68–85, 1975.
18. S. Kurtz, S. Mahaney, and J. Royer. The structure of complete degrees. In A. Selman, editor, Complexity Theory Retrospective, pages 108–146. Springer-Verlag, 1988.
19. S. Kurtz, S. Mahaney, and J. Royer. The isomorphism conjecture fails relative to a random oracle. In Proceedings of Annual ACM Symposium on the Theory of Computing, pages 157–166, 1989.
20. S. Lindell. A purely logical characterization of circuit complexity. In Proceedings of the Structure in Complexity Theory Conference, pages 185–192, 1992.
21. J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. In Proceedings of Annual ACM Symposium on the Theory of Computing, pages 213–223, 1990.
22. N. Nisan and A. Wigderson. Hardness vs. randomness. J. Comput. Sys. Sci., 49(2):149–167, 1994.
23. M. Sipser. Borel sets and circuit complexity. In Proceedings of Annual ACM Symposium on the Theory of Computing, pages 61–69, 1983.