A First-Order Isomorphism Theorem

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.

[1]  Leslie G. Valiant,et al.  A complexity theory based on Boolean algebra , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[2]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[3]  Neil Immerman,et al.  On Uniformity within NC¹ , 1990, J. Comput. Syst. Sci..

[4]  Udi Manber,et al.  Introduction to algorithms - a creative approach , 1989 .

[5]  Manindra Agrawal,et al.  Polynomial isomorphism of 1-L-complete sets , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[6]  Eric Allender.  Isomorphisms and 1-L Reductions , 1986, Computational Complexity Conference.

[7]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[8]  Neil Immerman,et al.  The complexity of iterated multiplication , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[9]  K. Ganesan.  One-Way Functions and the Isomorphism Conjecture , 1994, Theor. Comput. Sci..

[10]  Eric Allender,et al.  P-uniform circuit complexity , 1989, JACM.

[11]  Elias Dahlhaus,et al.  Reduction to NP-complete problems by interpretations , 1983, Logic and Machines.

[12]  Hans-Jörg Burtschick,et al.  The Degree Structure of 1-L Reductions , 1992, MFCS.

[13]  E. Griffor,et al.  Computational Complexity Theory , 2022 .

[14]  J. Håstad.  ONEWAY PERMUTATIONS IN NC 0 , 1987 .

[15]  Johan Håstad.  One-Way Permutations in NC0 , 1987, Inf. Process. Lett..

[16]  Stuart A. Kurtz,et al.  The Structure of Complete Degrees , 1990 .

[17]  J.A. Medina,et al.  A syntactic characterization of NP-completeness , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[18]  N. Immerman,et al.  On uniformity within NC 1 . , 1988 .

[19]  Iain A. Stewart,et al.  Using the Hamiltonian Path Operator to Capture NP , 1990, J. Comput. Syst. Sci..

[20]  Neil Immerman,et al.  Descriptive and Computational Complexity , 1989, FCT.

[21]  Shmuel Winograd,et al.  Complexity Of Computations , 1978, ACM Annual Conference.

[22]  Eric Allendery,et al.  On Strong Separations from AC 0 , 1995 .

[23]  E. Allender,et al.  On strong separations from ACo , 1991 .

[24]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[25]  Eric Allender,et al.  A Uniform Circuit Lower Bound for the Permanent , 1994, SIAM J. Comput..

[26]  Juris Hartmanis,et al.  On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..

[27]  Ronald Fagin.  Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .

[28]  Lane A. Hemaspaandra,et al.  Collapsing Degrees via Strong Computation (Extended Abstract) , 1991, ICALP.

[29]  Juris Hartmanis,et al.  On isomorphisms and density of NP and other complete sets , 1976, STOC '76.

[30]  Steven Lindell.  A purely logical characterization of circuit uniformity , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[31]  Neil Immerman,et al.  One-way log-tape reductions , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[32]  Günter Asser,et al.  Zeitschrift für mathematische Logik und Grundlagen der Mathematik , 1955 .

[33]  Paul Young,et al.  Juris Hartmanis: fundamental contributions to isomorphism problems , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[34]  Neil D. Jones,et al.  Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..

[35]  Jeffrey C. Lagarias,et al.  One-Way Functions and Circuit Complexity , 1986, Inf. Comput..

[36]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[37]  Deborah Joseph,et al.  Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP , 1985, Theor. Comput. Sci..

[38]  Stuart A. Kurtz,et al.  The isomorphism conjecture fails relative to a random oracle , 1995, JACM.

[39]  Uzi Vishkin,et al.  Constant Depth Reducibility , 1984, SIAM J. Comput..