A first-order isomorphism theorem

SIAM Journal on Computing

Volumn 26, Issue 2, 1997, Pages 557-567

  Allender, Eric ^a   Balcázar, José ^b   Immerman, Neil ^c  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^c Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

Complexity classes; Descriptive complexity; First order projection; Reduction

Indexed keywords

EID: 0042889710     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794270236     Document Type: Article

References (37)

1. M. AGRAWAL AND S. BISWAS, Polynomial isomorphism of 1-L-complete sets, in Proc. 8th Annual Structure in Complexity Theory Symposium, IEEE Computer Society Press, Los Alamitos, CA, 1993, pp. 75-79.
2. E. ALLENDER, Isomorphisms and 1-L reductions, J. Comput. System Sci., 36 (1988), pp. 336-350.
3. E. ALLENDER, P-uniform circuit complexity, J. Assoc. Comput. Mach., 36 (1989), pp. 912-928.
4. 0, in Advances in Computational Complexity Theory, J.-Y. Cai, ed., DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 13, AMS, Providence, RI, 1993, pp. 21-37.
5. E. ALLENDER AND V. GORE, A uniform circuit lower bound for the permanent, SIAM J. Comput., 23 (1994), pp. 1026-1049.
6. 1, J. Comput. System Sci., 41 (1990), pp. 274-306.
7. L. BERMAN AND J. HARTMANIS, On isomorphism and density of NP and other complete sets, SIAM J. Comput., 6 (1977), pp. 305-322.
8. R. BOPPANA AND J. LAGARIAS, One-way functions and circuit complexity, Inform. and Comput. 74 (1987), pp. 226-240.
9. H.-J. BURTSCHICK AND A. HOENE, The degree structure of 1-L reductions, in Proc. Math. Foundations of Computer Science, Lecture Notes in Comput. Sci. 629, Springer-Verlag, Berlin, 1992, pp. 153-161.
10. A. CHANDRA, L. STOCKMEYER, AND U. VISHKIN, Constant depth reducibility, SIAM J. Comput., 13 (1984), pp. 423-439.
11. S. COOK, The complexity of theorem proving procedures, in Proc. 3rd Annual ACM Symposium on the Theory of Computing, ACM, New York, 1971, pp. 151-158.
12. E. DAHLHAUS, Reduction to NP-complete problems by interpretations, in Logic and Machines: Decision Problems and Complexity, E. Börger, D. Rödding, and G. Hasenjaeger, eds., Lecture Notes in Comput. Sci. 171, Springer-Verlag, Berlin, 1984, pp. 357-365.
13. H. ENDERTON, A Mathematical Introduction to Logic, Academic Press, New York, 1972.
14. R. FAGIN, Generalized first-order spectra and polynomial-time recognizable sets, in Complexity of Computation: Proc. SIAM-AMS Symposia, R. Karp, ed., Vol. 7, SIAM, Philadelphia, 1974, pp. 43-73.
15. M. FURST, J. SAXE, AND M. SIPSER, Parity, circuits, and the polynomial-time hierarchy, Math. Systems Theory, 17 (1984), pp. 13-27.
16. K. GANESAN, One-way functions and the isomorphism conjecture, Theoret. Comput. Sci., 129 (1994), pp. 309-321.
17. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability, W. H. Freeman, San Francisco, 1979.
18. 0, Inform. Process. Letters, 26 (1987), pp. 153-155.
19. J. HARTMANIS, On the logtape isomorphism of complete sets, Theoret. Comput. Sci., 7 (1978), pp. 273-286.
20. J. HARTMANIS, N. IMMERMAN, AND S. MAHANEY, One-way log tape reductions, in Proc. 19th IEEE Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1978, pp. 65-72.
21. L. HEMACHANDRA AND A. HOENE, Collapsing degrees via strong computation, J. Comput. System Sci., 46 (1993), pp. 363-380.
22. N. IMMERMAN, Languages that capture complexity classes, SIAM J. Comput., 16 (1987), pp. 760-778.
23. N. IMMERMAN, Descriptive and computational complexity, in Computational Complexity Theory, J. Hartmanis, ed., Proc. Sympos. Appl. Math. 38, AMS, Providence, RI, 1989, pp. 75-91.
24. N. IMMERMAN AND S. LANDAU, The complexity of iterated multiplication, Inform. and Comput., 116 (1995), pp. 103-116.
25. N. JONES, Space-bounded reducibility among combinatorial problems, J. Comput. System Sci., 11 (1975), pp. 68-85.
26. D. JOSEPH AND P. YOUNG, Some remarks on witness functions for non-polynomial and non-complete sets in NP, Theoret. Comput. Sci., 39 (1985), pp. 225-237.
27. R. KARP, Reducibility among combinatorial problems, in Complexity of Computations, R. E. Miller and J. W. Thatcher, eds., Plenum Press, New York, 1972, pp. 85-104.
28. J. L. KELLEY, General Topology, Van Nostrand/Reinhold, New York, 1955.
29. S. KURTZ, S. MAHANEY, AND J. ROYER, The isomorphism conjecture fails relative to a random oracle, in Proc. 21st ACM Symposium on the Theory of Computing, ACM, New York, 1989, pp. 157-166.
30. S. KURTZ, S. MAHANEY, AND J. ROYER, The tructure of complete degrees, in Complexity Theory Retrospective, A. Selman, ed., Springer-Verlag, Berlin, 1990, pp. 108-146.
31. U. MANBER, Introduction to Algorithms: A Creative Approach, Addison-Wesley, Reading, MA, 1989.
32. J. A. MEDINA AND N. IMMERMAN, A syntactic characterization of NP-completeness, in IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1994, pp. 241-250.
33. J. MYHILL, Creative sets, Z. Math. Logik Grundlag. Math., 1 (1955), pp. 97-108.
34. S. SKYUM AND L. VALIANT, A complexity theory based on Boolean algebra, J. Assoc. Comput. Mach., 32 (1985), pp. 484-502.
35. I. STEWART, Using the Hamiltonian operator to capture NP, J. Comput. System Sci., 45 (1992), pp. 127-151.
36. L. VALIANT, Reducibility by algebraic projections, Enseign. Math., 28 (1982), pp. 253-268.
37. P. YOUNG, Juris Hartmanis: Fundamental contributions to isomorphism problems, in Complexity Theory Retrospective, A. Selman, ed., Springer-Verlag, Berlin, 1990, pp. 28-58.