Relativizations of the P =?NP and other Problems: Some Developments in Structural Complexity Theory

The P =?NP problem has provided much of the primary motivation for developments in structural complexity theory. Recent results show that even after twenty years, contributions to the P=?NP problem, as well as other problems, still inspire new efforts. The purpose of this talk is to explain some of these results to theoreticians who do not work in structural complexity theory.

[1]  渡邉 治.  On the structure of intractable complexity classes , 1987 .

[2]  Osamu Watanabe,et al.  A Comparison of Polynomial Time Completeness Notions , 1987, Theor. Comput. Sci..

[3]  Jin-Yi Cai.  On Some Most Probable Separations of Complexity Classes , 1986 .

[4]  Noam Nisan,et al.  Hardness vs. randomness , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[5]  Jack H. Lutz,et al.  On Complexity Classes and Algorithmically Random Languages (Extended Abstract) , 1992, STACS.

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

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

[8]  G. M. Clemence,et al.  Blow up of smooth solutions to the barotropic compressible magnetohydrodynamic equations with finite mass and energy , 2008, 0811.4359.

[9]  Klaus Ambos-Spies,et al.  Randomness, Relativizations, and Polynomial Reducibilities , 1986, SCT.

[10]  Johan Håstad,et al.  Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[11]  Timothy J. Long,et al.  Quantitative Relativizations of Complexity Classes , 1984, SIAM J. Comput..

[12]  Boris A. Trakhtenbrot,et al.  A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms , 1984, Annals of the History of Computing.

[13]  Jack H. Lutz,et al.  Category and Measure in Complexity Classes , 1990, SIAM J. Comput..

[14]  Ronald V. Book.  Some Observations on Separating Complexity Classes , 1991, SIAM J. Comput..

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  P. Martin-Löf.  Complexity oscillations in infinite binary sequences , 1971 .

[17]  Per Martin-Löf,et al.  The Definition of Random Sequences , 1966, Inf. Control..

[18]  Stuart A. Kurtz.  On the Random Oracle Hypothesis , 1983, Inf. Control..

[19]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[20]  Michael Sipser,et al.  The history and status of the P versus NP question , 1992, STOC '92.

[21]  Ker-I Ko.  Relativized Polynomial Time Hierarchies Having Exactly K Levels , 1989, SIAM J. Comput..

[22]  Mitsunori Ogihara,et al.  On one query, self-reducible sets , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[23]  Yehoshua Bar-Hillel,et al.  The Intrinsic Computational Difficulty of Functions , 1969 .

[24]  John Gill,et al.  Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..

[25]  Jacobo Torán,et al.  The graph isomorphism problem , 2020, Commun. ACM.

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

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

[28]  Jin-Yi Cai,et al.  With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy , 1986, STOC '86.

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

[30]  Andrew Chi-Chih Yao,et al.  Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.

[31]  S. Homer,et al.  On reductions of NP sets to sparse sets , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[32]  Juris Hartmanis.  Computational complexity theory , 1989 .

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

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

[35]  R. Solovay,et al.  Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[36]  Stephen R. Mahaney.  Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis , 1982, J. Comput. Syst. Sci..

[37]  Ding-Zhu Du,et al.  On One-Way Functions and Polynomial-Time Isomorphisms , 1986, Theor. Comput. Sci..

[38]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[39]  Ming Li,et al.  Kolmogorov Complexity and its Applications , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[40]  J. Feigenbaum,et al.  Probabilistic Algorithms for Speedup , 1993 .

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