Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Are there any known NP-hard problems that are easy on average as per the definition of average-case complexity by Levin?

share|cite|improve this question

How about this: Recognize strings of $2n$ bits such that at least one of the first $n$ bits is $1$ or the last $n$ bits describe a satisfiable Boolean formula.

(If that is not an example, you may have to remind me exactly what Levin's definition is).

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.