Advertisement

A first-order isomorphism theorem

  • Eric Allender
  • Jose Balcázar
  • Neil Immerman
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 665)

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.

Keywords

Binary String Boolean Variable Constant Symbol Closed Term Isomorphism Conjecture 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AB]
    Manindra Agrawal and Somenath Biswas, “Polynomial Isomorphism of 1-L-Complete Sets,” manuscript, 1992.Google Scholar
  2. [All88]
    Eric Allender, “Isomorphisms and 1-L Reductions,” J. Computer Sys. Sci. 36 (1988), 336–350.Google Scholar
  3. [All89]
    Eric Allender, “P-Uniform Circuit Complexity,” JACM 36 (1989), 912–928.Google Scholar
  4. [AG]
    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.Google Scholar
  5. [BIS]
    D. Barrington, N. Immerman, H. Straubing, “On Uniformity Within NC1,” J. Computer Sys. Sci. 41 (1990), 274–306.Google Scholar
  6. [BH77]
    Len Berman and Juris Hartmanis, “On Isomorphism and Density of NP and Other Complete Sets,” SIAM J. Comput. 6 (1977), 305–322.Google Scholar
  7. [BL]
    Ravi Boppana and Jeff Lagarias, “One-Way Functions and Circuit Complexity,” Information and Computation 74, (1987), 226–240.Google Scholar
  8. [BH90]
    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.Google Scholar
  9. [CSV]
    Ashok Chandra, Larry Stockmeyer, and Uzi Vishkin, “Constant Depth Reducibility,” SIAM J. Comput. 13, (1984), 423–439.Google Scholar
  10. [Coo71]
    Stephen Cook, “The Complexity of Theorem Proving Procedures,” Proc. Third Annual ACM STOC Symp. (1971), 151–158.Google Scholar
  11. [Dah]
    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.Google Scholar
  12. [End]
    Herbert Enderton, A Mathematical Introduction to Logic, Academic Press, 1972.Google Scholar
  13. [FSS]
    Merrick Furst, James Saxe, and Michael Sipser, “Parity, Circuits, and the Polynomial-Time Hierarchy,” Math. Systems Theory 17 (1984), 13–27.Google Scholar
  14. [GJ]
    M. R. Garey and D. S. Johnson, Computers and Intractability, Freeman, 1979.Google Scholar
  15. [Ha]
    Johan Hastad, “One-Way Permutations in NC0,” Information Processing Letters 26 (1987), 153–155.Google Scholar
  16. [HIM]
    Juris Hartmanis, Neil Immerman, and Stephen Mahaney, “One-Way Log Tape Reductions,” 19th IEEE FOCS Symp. (1978), 65–72.Google Scholar
  17. [HH]
    L. Hemachandra and A. Hoene, “Collapsing Degrees Via Strong Computation,” to appear in J. of Computer Sys. Sci..Google Scholar
  18. [Imm87]
    Neil Immerman, “Languages That Capture Complexity Classes,” SIAM J. Comput. 16, (1987), 760–778.Google Scholar
  19. [Imm89]
    Neil Immerman, “Descriptive and Computational Complexity,” Computational Complexity Theory, ed. J. Hartmanis, Proc. Symp. in Applied Math., 38, American Mathematical Society (1989), 75–91.Google Scholar
  20. [IL]
    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.Google Scholar
  21. [Jon]
    Neil Jones, “Space-Bounded Reducibility among Combinatorial Problems,” J. Computer Sys. Sci. 11 (1975), 68–85.Google Scholar
  22. [JY]
    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.Google Scholar
  23. [Kar]
    Richard Karp, “Reducibility Among Combinatorial Problems,” in Complexity of Computations, R.E.Miller and J.W.Thatcher, eds. (1972), Plenum Press, 85–104.Google Scholar
  24. [KMR]
    Stuart Kurtz, Stephen Mahaney, James Royer, “The Structure of Complete Degrees,” in Complexity Theory Retrospective (Alan Selman, Ed.), Springer-Verlag, 1990, pp. 108–146.Google Scholar
  25. [Lin]
    Stephen Lindell, “A Purely Logical Characterization of Circuit Uniformity,” Seventh IEEE Structure in Complexity Theory Symp. (1992), 185–192.Google Scholar
  26. [M89]
    Udi Manber, Introduction to Algorithms: A Creative Approach, Addison-Wesley, 1989.Google Scholar
  27. [Ste]
    Iain Stewart, “Using the Hamiltonian Operator to Capture NP,” to appear in J. Comput. Sys. Sci. (1992).Google Scholar
  28. [Val]
    L.G. Valiant, “Reducibility By Algebraic Projections,” L'Enseignement mathématique, 28, 3–4 (1982), 253–68.Google Scholar
  29. [You]
    Paul Young, “Juris Hartmanis: Fundamental Contributions to Isomorphism Problems,” in Complexity Theory Retrospective, Alan Selman, ed., Springer-Verlag (1990), 28–58.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Eric Allender
    • 1
  • Jose Balcázar
    • 2
  • Neil Immerman
    • 3
  1. 1.Department of Computer SciencePrinceton UniversityPrincetonUSA
  2. 2.Departamento L.S.I.U. Politècnica de CatalunyaBarcelonaSpain
  3. 3.Computer Science DepartmentUniversity of MassachusettsAmherstUSA

Personalised recommendations