Abstract
The average case complexity classes 〈P, L-samplable〉 and 〈NL, L-samplable〉 are defined and we show that Deterministic Bounded Halting is complete for 〈P, L-samplable〉 and that Graph Reachability is complete for 〈NL, L-samplable〉.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Ben-David, B. Chor, O. Goldreich and M. Luby, On the Theory of Average Case Complexity, Proc. 21st Symp. on Theory of Computing, ACM, 1989, 204–216.
Y. Gurevich, Complete and Incomplete Randomized NP Problems, Proc. 28th Annual Symp. on Found. of Computer Science, IEEE, 1987, 111–117.
R. Impagliazzo and L. Levin. Private communication 1989.
D. S. Johnson, The NP-Completeness Column, Journal of Algorithms 5 (1984), 284–299.
L. Levin, Average Case Complete Problems, SIAM Journal of Computing, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grape, P. (1990). Complete problems with L-samplable distributions. In: Gilbert, J.R., Karlsson, R. (eds) SWAT 90. SWAT 1990. Lecture Notes in Computer Science, vol 447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52846-6_104
Download citation
DOI: https://doi.org/10.1007/3-540-52846-6_104
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52846-3
Online ISBN: 978-3-540-47164-6
eBook Packages: Springer Book Archive