Abstract
We show that for most complexity classes of interest, all sets complete under first-order projections are isomorphic under first-order isomorphisms. That is, a very restricted version of the Berman-Hartmanis Conjecture holds.
On leave from Rutgers University; supported in part by National Science Foundation grant CCR-9204874.
Supported in part by ESPRIT-II BRA EC project 3075 (ALCOM) and by Acción Integrada Hispano-Alemana 131 B
Supported by NSF grants CCR-9008416 and CCR-9207797.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Manindra Agrawal and Somenath Biswas, “Polynomial Isomorphism of 1-L-Complete Sets,” manuscript, 1992.
Eric Allender, “Isomorphisms and 1-L Reductions,” J. Computer Sys. Sci. 36 (1988), 336–350.
Eric Allender, “P-Uniform Circuit Complexity,” JACM 36 (1989), 912–928.
Eric Allender and Vivek Gore, “A Uniform Circuit Lower Bound for the Permanent,” DIMACS Tech Report 92-30. A preliminary version appeared as “On Strong Separations from AC0,” Proc. FCT '91, Lecture Notes in Computer Science 529, Springer-Verlag, 1991, 1–15.
D. Barrington, N. Immerman, H. Straubing, “On Uniformity Within NC1,” J. Computer Sys. Sci. 41 (1990), 274–306.
Len Berman and Juris Hartmanis, “On Isomorphism and Density of NP and Other Complete Sets,” SIAM J. Comput. 6 (1977), 305–322.
Ravi Boppana and Jeff Lagarias, “One-Way Functions and Circuit Complexity,” Information and Computation 74, (1987), 226–240.
Hans-Jörg Burtschick and Albrecht Hoene, “The degree structure of 1-L reductions,” Proc. Math. Foundations of Computer Science, Lecture Notes in Computer Science 629, Springer-Verlag, 1992, 153–161.
Ashok Chandra, Larry Stockmeyer, and Uzi Vishkin, “Constant Depth Reducibility,” SIAM J. Comput. 13, (1984), 423–439.
Stephen Cook, “The Complexity of Theorem Proving Procedures,” Proc. Third Annual ACM STOC Symp. (1971), 151–158.
Elias Dahlhaus, “Reduction to NP-Complete Problems by Interpretations,” in Logic and Machines: Decision Problems and Complexity, Börger, Rödding, and Hasenjaeger eds., Lecture Notes In Computer Science 171, Springer-Verlag, 1984, 357–365.
Herbert Enderton, A Mathematical Introduction to Logic, Academic Press, 1972.
Merrick Furst, James Saxe, and Michael Sipser, “Parity, Circuits, and the Polynomial-Time Hierarchy,” Math. Systems Theory 17 (1984), 13–27.
M. R. Garey and D. S. Johnson, Computers and Intractability, Freeman, 1979.
Johan Hastad, “One-Way Permutations in NC0,” Information Processing Letters 26 (1987), 153–155.
Juris Hartmanis, Neil Immerman, and Stephen Mahaney, “One-Way Log Tape Reductions,” 19th IEEE FOCS Symp. (1978), 65–72.
L. Hemachandra and A. Hoene, “Collapsing Degrees Via Strong Computation,” to appear in J. of Computer Sys. Sci..
Neil Immerman, “Languages That Capture Complexity Classes,” SIAM J. Comput. 16, (1987), 760–778.
Neil Immerman, “Descriptive and Computational Complexity,” Computational Complexity Theory, ed. J. Hartmanis, Proc. Symp. in Applied Math., 38, American Mathematical Society (1989), 75–91.
N. Immerman, S. Landau, “The Complexity of Iterated Multiplication,” Fourth Annual Structure in Complexity Theory Symp. (1989), 104–111. Revised version submitted to Information and Computation.
Neil Jones, “Space-Bounded Reducibility among Combinatorial Problems,” J. Computer Sys. Sci. 11 (1975), 68–85.
Deborah Joseph and Paul Young, “Some Remarks on Witness Functions for Non-polynomial and Non-complete sets in NP,” Theoretical Computer Science 39 (1985), 225–237.
Richard Karp, “Reducibility Among Combinatorial Problems,” in Complexity of Computations, R.E.Miller and J.W.Thatcher, eds. (1972), Plenum Press, 85–104.
Stuart Kurtz, Stephen Mahaney, James Royer, “The Structure of Complete Degrees,” in Complexity Theory Retrospective (Alan Selman, Ed.), Springer-Verlag, 1990, pp. 108–146.
Stephen Lindell, “A Purely Logical Characterization of Circuit Uniformity,” Seventh IEEE Structure in Complexity Theory Symp. (1992), 185–192.
Udi Manber, Introduction to Algorithms: A Creative Approach, Addison-Wesley, 1989.
Iain Stewart, “Using the Hamiltonian Operator to Capture NP,” to appear in J. Comput. Sys. Sci. (1992).
L.G. Valiant, “Reducibility By Algebraic Projections,” L'Enseignement mathématique, 28, 3–4 (1982), 253–68.
Paul Young, “Juris Hartmanis: Fundamental Contributions to Isomorphism Problems,” in Complexity Theory Retrospective, Alan Selman, ed., Springer-Verlag (1990), 28–58.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Allender, E., Balcázar, J., Immerman, N. (1993). A first-order isomorphism theorem. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_19
Download citation
DOI: https://doi.org/10.1007/3-540-56503-5_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56503-1
Online ISBN: 978-3-540-47574-3
eBook Packages: Springer Book Archive