论文信息 - Minimal pairs for P

Minimal pairs for P

Abstract We prove a general minimal pair theorem which yields as corollaries many results about minimal pairs for P obtained previously by various authors. Furthermore, it yields the new counterintuitive result that there exist ‘arbitrarily complex’ minimal pairs. We also investigate the question of whether minimal pairs in NP are ‘low’.

Uwe Schöning

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

[2] Alistair H. Lachlan,et al. Lower Bounds for Pairs of Recursively Enumerable Degrees , 1966 .

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

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

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

[6] Ronald V. Book,et al. Tally Languages and Complexity Classes , 1974, Inf. Control..

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

[8] Alistair H. Lachlan. Bounding Minimal Pairs , 1979, J. Symb. Log..

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