On the Reducibility of Sets Inside NP to Sets with Low Information Content

This paper studies for various natural problems in NP whether they can be reduced to sets with low information content, such as branches, P-selective sets, and membership comparable sets. The problems that are studied include the satisfiability problem, the graph automorphism problem, the undirected graph accessibility problem, the determinant function, and all logspace self-reducible languages. Some of these are complete for complexity classes within NP, but for others an exact complexity theoretic characterization is not known. Reducibility of these problems is studied in a general framework introduced in this paper: prover-verifier protocols with low-complexity provers. It is shown that all these natural problems indeed have such protocols. This fact is used to show, for certain reduction types, that these problems are not reducible to sets with low information content unless their complexity is much less than what it is currently believed to be. The general framework is also used to obtain a new characterization of the complexity class L : L is the class of all logspace self-reducible sets in LL-sel.

[1]  Till Tantau,et al.  On Reachability in Graphs with Bounded Independence Number , 2002, COCOON.

[2]  Till Tantau.  A Note on the Complexity of the Reachability Problem for Tournaments , 2001, Electron. Colloquium Comput. Complex..

[3]  H. Venkateswaran.  Properties that Characterize LOGCFL , 1991, J. Comput. Syst. Sci..

[4]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[5]  Yacov Yacobi,et al.  The Complexity of Promise Problems with Applications to Public-Key Cryptography , 1984, Inf. Control..

[6]  J. Moon.  Topics on tournaments , 1968 .

[7]  S. Cox,et al.  Exponential Time Differencing for Stiff Systems , 2002 .

[8]  Seinosuke Toda,et al.  On polynomial-time truth-table reducibility of intractable sets to P-selective sets , 1991, Mathematical systems theory.

[9]  Jin-Yi Cai,et al.  Enumerative Counting Is Hard , 1989, Inf. Comput..

[10]  Rudolf Mathon,et al.  A Note on the Graph Isomorphism counting Problem , 1979, Inf. Process. Lett..

[11]  Ingo Wegener,et al.  Complexity Theory , 2005 .

[12]  Desh Ranjan,et al.  On randomized reductions to sparse sets , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[13]  Norbert Sauer,et al.  On the Density of Families of Sets , 1972, J. Comb. Theory A.

[14]  Brian J. McCartin.  Exponential fitting of the delayed recruitment/renewal equation , 2001 .

[15]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[16]  H. De Meyer,et al.  Exponentially fitted variable two-step BDF algorithm for first order ODEs☆ , 2003 .

[17]  Walter L. Ruzzo.  On Uniform Circuit Complexity , 1981, J. Comput. Syst. Sci..

[18]  L. Shampine,et al.  Computer solution of ordinary differential equations : the initial value problem , 1975 .

[19]  H. De Meyer,et al.  Frequency determination and step-length control for exponentially-fitted Runge---Kutta methods , 2001 .

[20]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[21]  Richard Beigel.  A structural theorem that depends quantitatively on the complexity of SAT , 1987, Computational Complexity Conference.

[22]  Tom E. Simos.  A fourth algebraic order exponentially-fitted Runge-Kutta method for the numerical solution of the Schrödinger equation , 2001 .

[23]  Mitsunori Ogihara.  Polynomial-Time Membership Comparable Sets , 1995, SIAM J. Comput..

[24]  Mitsunori Ogihara,et al.  The (Non)Enumerability of the Determinant and the Rank , 2003, Theory of Computing Systems.

[25]  Yacov Yacobi,et al.  Cryptocomplexity and NP-Completeness , 1980, ICALP.

[26]  Vikraman Arvind,et al.  Polynomial time truth-table reductions to p-selective sets , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[27]  Eric Allender,et al.  Uniform circuits for division: consequences and problems , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[28]  A. Lozano,et al.  On the nonuniform complexity of the graph isomorphism problem , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[29]  R.E. Ladner,et al.  A Comparison of Polynomial Time Reducibilities , 1975, Theor. Comput. Sci..

[30]  G. Vanden Berghe,et al.  Optimal implicit exponentially-fitted Runge–Kutta methods , 2001 .

[31]  Osamu Watanabe,et al.  On Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets , 1991, SIAM J. Comput..

[32]  J. Rosser,et al.  Approximate formulas for some functions of prime numbers , 1962 .

[33]  Lane A. Hemaspaandra,et al.  A Note on Linear-Nondeterminism, Linear-Sized, Karp-Lipton Advice for the P-Selective Sets , 1998, J. Univers. Comput. Sci..

[34]  Frank Stephan,et al.  Approximable Sets , 1995, Inf. Comput..

[35]  Lane A. Hemaspaandra,et al.  Reductions to Sets of Low Information Content , 1992, Complexity Theory: Current Research.

[36]  Frank Stephan,et al.  Quantifying the Amount of Verboseness , 1995, Inf. Comput..

[37]  E. B. Lin,et al.  Connection coefficients on an interval and wavelet solutions of Burgers equation , 2001 .

[38]  D. Sivakumar.  On Membership Comparable Sets , 1999, J. Comput. Syst. Sci..

[39]  Carme Àlvarez,et al.  A Very Hard log-Space Counting Class , 1993, Theor. Comput. Sci..

[40]  V Vinay.  Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[41]  Lane A. Hemaspaandra,et al.  Computing Solutions Uniquely Collapses the Polynomial Hierarchy , 1996, SIAM J. Comput..

[42]  Nancy A. Lynch,et al.  Relativization of questions about log space computability , 1976, Mathematical systems theory.

[43]  R. Holland,et al.  Finite-difference time-domain (FDTD) analysis of magnetic diffusion , 1994 .

[44]  Haiqing Yan,et al.  The various order explicit multistep exponential fitting for systems of ordinary differential equations , 2004 .

[45]  Volker Diekert,et al.  Regular frequency computations , 2005, Theor. Comput. Sci..

[46]  Alberto Bertoni,et al.  Generalized Boolean Hierarchies and Boolean Hierarchies Over RP (Conference Abstract) , 1989, FCT.

[47]  Volker Diekert,et al.  A structural property of regular frequency computations , 2003, Theor. Comput. Sci..

[48]  Neil Immerman,et al.  Sparse Sets in NP-P: EXPTIME versus NEXPTIME , 1985, Inf. Control..

[49]  Dieter van Melkebeek,et al.  Deterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets , 1998, J. Comput. Syst. Sci..

[50]  Jie Wang,et al.  Nondeterministically Selective Sets , 1995, Int. J. Found. Comput. Sci..

[51]  Christos H. Papadimitriou,et al.  Symmetric Space-Bounded Computation , 1982, Theor. Comput. Sci..

[52]  Till Tantau.  A Note on the Power of Extra Queries to Membership Comparable Sets , 2002, Electron. Colloquium Comput. Complex..

[53]  Harry Buhrman,et al.  P-Selective Self-Reducible Sets , 1996 .

[54]  José L. Balcázar.  Logspace self-reducibility , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.

[55]  Harry Buhrman,et al.  P-selective self-reducibles sets: a new characterization of P , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[56]  Allan Borodin,et al.  Two Applications of Inductive Counting for Complementation Problems , 1989, SIAM J. Comput..

[57]  Ker-I Ko.  On Self-Reducibility and Weak P-Selectivity , 1983, J. Comput. Syst. Sci..

[58]  Jacobo Torán,et al.  On finding the number of graph automorphisms , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[59]  Noam Nisan,et al.  Symmetric logspace is closed under complement , 1995, STOC '95.

[60]  Andrew Chiu,et al.  Division in logspace-uniform NC1 , 2001, RAIRO Theor. Informatics Appl..

[61]  Christoph Meinel,et al.  Structure and importance of logspace-MOD class , 1992, Mathematical systems theory.

[62]  Lane A. Hemaspaandra,et al.  Optimal Advice , 1996, Theor. Comput. Sci..

[63]  Alan L. Selman,et al.  P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP , 1979, Mathematical systems theory.

[64]  Vikraman Arvind,et al.  A Note on Decision versus Search for Graph Automorphism , 1996, Inf. Comput..

[65]  Silvio Micali,et al.  Proofs that yield nothing but their validity and a methodology of cryptographic protocol design , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[66]  J. M. Keiser,et al.  A New Class of Time Discretization Schemes for the Solution of Nonlinear PDEs , 1998 .

[67]  J. Köbler,et al.  The Graph Isomorphism Problem: Its Structural Complexity , 1993 .

[68]  Vikraman Arvind,et al.  Quasi-Linear Truth-Table Reductions to p-Selective Sets , 1996, Theor. Comput. Sci..

[69]  Juris Hartmanis.  On Sparse Sets in NP - P , 1983, Inf. Process. Lett..

[70]  L. Valiant.  Why is Boolean complexity theory difficult , 1992 .

[71]  R. Beigel.  Query-limited reducibilities , 1988 .