Notions of Average-Case Complexity for Random 3-SAT

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.

• Type: Conference
• Year: 2004
• Where: CSL
• Authors: Albert Atserias
• Keywords: Average-case Complexity, CSL 2004, Dense Formulas, Distributional Problem