Quasilinear Time Complexity Theory

This paper furthers the study of quasi-linear time complexity initiated by Schnorr [Sch76] and Gurevich and Shelah [GS89]. We show that the fundamental properties of the polynomial-time hierarchy carry over to the quasilinear-time hierarchy. Whereas all previously known versions of the Valiant-Vazirani reduction from NP to parity run in quadratic time, we give a new construction using error-correcting codes that runs in quasilinear time. We show, however, that the important equivalence between search problems and decision problems in polynomial time is unlikely to carry over: if search reduces to decision for SAT in quasi-linear time, then all of NP is contained in quasi-polynomial time. Other connections are made to work by Stearns and Hunt [SH86, SH90, HS90] on \power indices" of NP languages, and to work on bounded-query Turing reductions and helping by robust oracle machines.

[1]  Amihood Amir,et al.  Some connections between bounded query classes and nonuniform complexity , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[2]  P. Vitányi,et al.  Applications of Kolmogorov Complexity in the Theory of Computation , 1990 .

[3]  Seinosuke Toda,et al.  PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..

[4]  NaorMoni,et al.  Small-bias probability spaces , 1993 .

[5]  Douglas R. Stinson.  Some Observations on Parallel Algorithms for Fast Exponentiation in GF(2^n) , 1990, SIAM J. Comput..

[6]  Christos H. Papadimitriou,et al.  Two remarks on the power of counting , 1983, Theoretical Computer Science.

[7]  Aravind Srinivasan,et al.  Randomness-optimal unique element isolation, with applications to perfect matching and related problems , 1993, SIAM J. Comput..

[8]  Moni Naor,et al.  Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.

[9]  Seinosuke Toda.  On the computational power of PP and (+)P , 1989, 30th Annual Symposium on Foundations of Computer Science.

[10]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[11]  Jørn Justesen,et al.  Class of constructive asymptotically good algebraic codes , 1972, IEEE Trans. Inf. Theory.

[12]  Leonid A. Levin,et al.  Checking computations in polylogarithmic time , 1991, STOC '91.

[13]  Ker-I Ko,et al.  On Helping by Robust Oracle Machines , 1987, Theor. Comput. Sci..

[14]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[15]  Mark W. Krentel.  The complexity of optimization problems , 1986, STOC '86.

[16]  Harry B. Hunt,et al.  The Complexity of Very Simple Boolean Formulas with Applications , 1990, SIAM J. Comput..

[17]  Ronald V. Book.  What is Structural Complexity Theory , 1989 .

[18]  Amihood Amir,et al.  Polynomial Terse Sets , 1988, Inf. Comput..

[19]  Oded Goldreich,et al.  On the theory of average case complexity , 1989, STOC '89.

[20]  Tom Høholdt,et al.  Fast decoding of codes from algebraic plane curves , 1992, IEEE Trans. Inf. Theory.

[21]  Jack H. Lutz,et al.  The complexity and distribution of hard problems , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

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

[23]  Larry Carter,et al.  Universal Classes of Hash Functions , 1979, J. Comput. Syst. Sci..

[24]  Saharon Shelah,et al.  Nearly Linear Time , 1989, Logic at Botik.

[25]  Ker-I Ko,et al.  Some Observations on the Probabilistic Algorithms and NP-hard Problems , 1982, Inf. Process. Lett..

[26]  Celia Wrathall,et al.  Complete Sets and the Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[27]  Stephen A. Cook,et al.  Time-bounded random access machines , 1972, J. Comput. Syst. Sci..

[28]  Joan Feigenbaum,et al.  Languages that are easier than their proofs , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[29]  David A. Mix Barrington.  Quasipolynomial size circuit classes , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[30]  Alan J. Demers,et al.  Some Comments on Functional Self-Reducibility and the NP Hierarchy , 1976 .

[31]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[32]  Paul Young,et al.  Self-Reducibility: Effects of Internal Structure on Computational Complexity , 1990 .

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

[34]  Mitsunori Ogihara,et al.  P-selective sets, and reducing search to decision vs. self-reducibility , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[35]  Noga Alon,et al.  Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.

[36]  Ba-Zhong Shen.  A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate , 1993, IEEE Trans. Inf. Theory.

[37]  Jack H. Lutz,et al.  The quantitative structure of exponential time , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[38]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[39]  Arfst Nickelsen,et al.  Counting, Selecting, adn Sorting by Query-Bounded Machines , 1993, STACS.

[40]  John Gill,et al.  Terse, Superterse, and Verbose Sets , 1993, Inf. Comput..

[41]  Alan L. Selman,et al.  P-Selective Sets, Tally Languages, and the Behavior of Polynomial Time Reducibilities on NP , 1979, ICALP.

[42]  R. Beigel,et al.  Bounded Queries to SAT and the Boolean Hierarchy , 1991, Theor. Comput. Sci..

[43]  Celia Wrathall,et al.  Rudimentary Predicates and Relative Computation , 1978, SIAM J. Comput..

[44]  Alan L. Selman.  Natural Self-Reducible Sets , 1988, SIAM J. Comput..

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

[46]  Claus-Peter Schnorr.  Satisfiability Is Quasilinear Complete in NQL , 1978, JACM.

[47]  José L. Balcázar,et al.  Self-reducibility structures and solutions of NP problemst , 1989 .

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