This research was done while the second and the third authors were guest professors at the Mathematics Institute of the University of Heidelberg.
Supported in part by National Science Foundation Grant CCR-8814339, National Security Agency Grant MDA904-87-H, and a Fulbright-Hays Research Fellowship.
Supported in part by National Science Foundation Grants DMS-8807389 and INT-8722296 and a grant of the Deutsche Forschungsgemeinschaft.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Ambos-Spies, Minimal pairs for polynomial time reducibilities, in Computation Theory and Logic, E. Börger ed., Lecture Notes in Computer Science, 270, (1987), 1–14.
K. Ambos-Spies, Polynomial time degrees of NP sets, in Current Trends in Theoretical Computer Science, E. Börger ed., Computer Science Press, 1987.
K. Ambos-Spies, An inhomogeneity in the polynomial time degrees, SIAM J. Comput. 15 (1986) 958–963.
T. Baker, J. Gill and R. Solovay, Relativizations of the P=?NP questions, SIAM J. Comput. 4 (1975), 431–442.
P. Chew and M. Machtey, A note on structure and looking back applied to the relative complexity of computable functions, J. Computer System Sci. 22 (1981), 53–59.
R. Downey, Nondiamond theorems for polynomial time reducibility (to appear).
H. Heller, Relativized polynomial hierarchy extending two levels, Thesis, Technische Universität Munich, (1980).
S. Homer and W. Maass, Oracle dependent properties of the lattice of NP sets, Theor. Comp. Science 24 (1983), 279–289.
R. E. Ladner, On the structure of polynomial time reducibility, JACM 22 (1975), 155–171.
L. H. Landweber, R. J. Lipton and E.L. Robertson, On the structure of sets in NP and other complexity classes, Theor. Comp. Sci. 15 (1981), 103–123.
M. Machtey, Minimal pairs of polynomial degrees with subexponential complexity, Theor. Comp. Sci. 2 (1976), 73–76.
U. Schöning, A uniform approach to obtain diagonal sets in complexity classes, Theor. Comp. Sci. 18 (1982), 95–103.
U. Schöning, Minimal pairs for P, Theor. Comp. Sci. 31 (1984), 41–48.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ambos-Spies, K., Homer, S., Soare, R.I. (1990). Minimal pairs and complete problems. In: Choffrut, C., Lengauer, T. (eds) STACS 90. STACS 1990. Lecture Notes in Computer Science, vol 415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52282-4_29
Download citation
DOI: https://doi.org/10.1007/3-540-52282-4_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52282-9
Online ISBN: 978-3-540-46945-2
eBook Packages: Springer Book Archive