Abstract
By viewing random 3-SAT as a distributional problem, we go over some of the notions of average-case complexity that were considered in the literature. We note that for dense formulas the problem is polynomial-time on average in the sense of Levin. For sparse formulas the question remains widely open despite several recent attempts.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beame, P., Karp, R., Pitassi, T., Saks, M.: The efficiency of resolution and Davis-Putnam procedures. SIAM Journal of Computing, 1048–1075 (2002)
Cook, S.: The complexity of theorem proving procedures. 3rd Annual ACM Symposium on the Theory of Computing, 151–158 (1971)
Friedman, J., Goerdt, A.: Recognizing more unsatisfiable random 3-SAT instances efficiently. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 310–321. Springer, Heidelberg (2001)
Hastad, J.: Some optimal inapproximability results. Journal of the ACM 48, 798–859 (2001)
Impagliazzo, R.: A personal view of average-case complexity. 10th IEEE Structure in Complexity Theory, 134–147 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Atserias, A. (2004). Notions of Average-Case Complexity for Random 3-SAT. In: Marcinkowski, J., Tarlecki, A. (eds) Computer Science Logic. CSL 2004. Lecture Notes in Computer Science, vol 3210. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30124-0_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-30124-0_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23024-3
Online ISBN: 978-3-540-30124-0
eBook Packages: Springer Book Archive