Abstract
In this paper, we discuss the complexity and properties of the sets which are computable in polynomial-time on average. This study is motivated by Levin's question of whether all sets in NP are solvable in polynomial-time on average for every reasonable (i.e., polynomial-time computable) distribution on the instances. Let PP-comp denote the class of all those sets which are computable in polynomial-time on average for every polynomial-time computable distribution on the instances. It is known that P ⊂ PP-comp ⊂ E. In this paper, we show that PP-comp is not contained in DTIME(2cn) for any constant c and that it lacks some basic structural properties: for example, it is not closed under many-one reducibility or for the existential operator. From these results, it follows that PP-comp contains P-immune sets but no P-bi-immune sets; it is not included in P/cn for any constant c; and it is different from most of the well-known complexity classes, such as UP, NP, BPP, and PP. Finally, we show that, relative to a random oracle, NP is not included in PP-comp and PP-comp is not in PSPACE with probability 1.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J.L. Balcázar, J. Díaz, and J. Gabarró, Structural complexity I+II, Springer, Berlin, 1989(I), 1990(II).
J.L. Balcázar and U. Schöning, Bi-immune sets for complexity classes, Math. Systems Theory, 18 (1985), pp.1–10.
J. Belanger and J. Wang, Isomorphisms of NP complete problems on random instances, in Proc., 8th Conf. on Structure in Complexity Theory, 1993, pp.65–74.
S. Ben-David, B. Chor, O. Goldreich, and M. Luby, On the theory of average case complexity, J. Comput. System Sci., 44 (1992), pp.193–219.
C.H. Bennett and J. Gill, Relative to a random oracle A, PA ≠ NPA ≠ co-NPA with probability 1, SIAM J. Comput., 10 (1981), pp.96–113.
J. Goldsmith, L.A. Hemachandra, D. Joseph, and P. Young, Near-testable sets, SIAM. J. Comput., 20 (1991), pp.506–523.
Y. Gurevich, Average case complexity, J. Comput. System Sci., 42 (1991), pp.346–398.
R. Impagliazzo and L. Levin, No better ways to generate hard NP instances than picking uniformly at random, in Proc., 31st FOCS, 1990, pp.812–821.
K.I. Ko and H. Friedman, Computational complexity of real functions, Theoret. Comput. Sci., 20 (1982), pp.323–352.
K.I. Ko and D. Moore, Completeness, approximation and density, SIAM J. Comput., 10 (1981), pp.787–796.
L. Levin, Average case complete problems, SIAM J. Comput., 15 (1986), pp.285–286. A preliminary version appeared in Proc., 16th STOC, 1984, p.465.
E. Mayordomo, Almost every set in exponential time is P-bi-immune, in Proc., 17th MFCS, LNCS, Vol.629, 1992, pp.392–400.
A.R. Meyer and M. Paterson, With what frequency are apparently intractable problems difficult, Technical Report TM-126, MIT, 1979.
P. Orponen and U. Schöning, On the density and complexity of polynomial cores for intractable sets, Inform. Control, 70 (1986), pp.54–68.
R. Schuler, On average polynomial time, Technical Report, Universität Ulm, 1994.
R. Schuler and T. Yamakami, Structural average case complexity, in Proc., 12th FST & TCS, LNCS, Vol.652, 1992, pp 128–139.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schuler, R., Yamakami, T. (1995). Sets computable in polynomial time on average. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030859
Download citation
DOI: https://doi.org/10.1007/BFb0030859
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60216-3
Online ISBN: 978-3-540-44733-7
eBook Packages: Springer Book Archive