论文信息 - Minimal Pairs and Complete Problems - 字舞流文

Minimal Pairs and Complete Problems

Robert I. Soare | Klaus Ambos-Spies | Steven Homer

[1] PAUL CHEW,et al. A Note on Structure and Looking Back Applied to the Complexity of Computable Functions , 1981, J. Comput. Syst. Sci..

[2] Richard E. Ladner,et al. On the Structure of Polynomial Time Reducibility , 1975, JACM.

[3] Richard J. Lipton,et al. On the Structure of Sets in NP and Other Complexity Classes , 1981, Theor. Comput. Sci..

[4] Klaus Ambos-Spies. Minimal Pairs for Polynomial Time Reducibilities , 1987, Computation Theory and Logic.

[5] Uwe Schöning. Minimal pairs for P , 1984, Theor. Comput. Sci..

[6] Michael Machtey. Minimal Pairs of Polynomial Degrees with Subexponential Complexity , 1976, Theor. Comput. Sci..

[7] Wolfgang Maass,et al. Oracle-Dependent Properties of the Lattice of NP Sets , 1983, Theor. Comput. Sci..

[8] Klaus Ambos-Spies. An Inhomogeneity in the Structure of Karp Degrees , 1986, SIAM J. Comput..

[9] Uwe Schöning. A Uniform Approach to Obtain Diagonal Sets in Complexity Classes , 1982, Theor. Comput. Sci..

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