Locating P/poly Optimally in the Extended Low Hierarchy

The low hierarchy in NP and the extended low hierarchy have turned out to be very useful in classifying many interesting language classes, and almost all of them could be located optimally therein. However, until now, the exact location of P/poly remained open.

[1]  Uwe Schöning,et al.  A Low and a High Hierarchy within NP , 1983, J. Comput. Syst. Sci..

[2]  Vikraman Arvind,et al.  Lowness and the Complexity of Sparse and Tally Descriptions , 1992, ISAAC.

[3]  Jacobo Torán,et al.  On Counting and Approximation , 1988, CAAP.

[4]  Ker-I Ko,et al.  On Circuit-Size Complexity and the Low Hierarchy in NP , 1985, SIAM J. Comput..

[5]  Timothy J. Long,et al.  The Extended Low Hierarchy is an Infinite Hierarchy , 1994, SIAM J. Comput..

[6]  José L. Balcázar,et al.  Structural Complexity II , 2012, EATCS.

[7]  Michael Sipser,et al.  A complexity theoretic approach to randomness , 1983, STOC.

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

[9]  Klaus W. Wagner,et al.  Bounded Query Classes , 1990, SIAM J. Comput..

[10]  Uwe Schöning.  Graph Isomorphism is in the Low Hierarchy , 1988, J. Comput. Syst. Sci..

[11]  Eric Allender,et al.  Lower bounds for the low hierarchy , 1992, JACM.

[12]  Vaughan R. Pratt,et al.  Every Prime has a Succinct Certificate , 1975, SIAM J. Comput..

[13]  Osamu Watanabe,et al.  How hard are sparse sets? , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

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

[15]  Larry J. Stockmeyer,et al.  On Approximation Algorithms for #P , 1985, SIAM J. Comput..

[16]  Thomas Thierauf,et al.  Complexity classes with advice , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

[17]  Nicholas Pippenger,et al.  On simultaneous resource bounds , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[18]  D. Angluin.  Queries and Concept Learning , 1988 .

[19]  Uwe Schöning,et al.  Complexity and Structure , 1986, Lecture Notes in Computer Science.

[20]  Ricard Gavaldà.  Bounding the complexity of advice functions , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

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

[22]  José L. Balcázar,et al.  Sparse Sets, Lowness and Highness , 1986, SIAM J. Comput..

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

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