Are there any known NP-hard problems that are easy on average as per the definition of average-case complexity by Levin?
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
Here's how it works:
- Anybody can ask a question
- Anybody can answer
- The best answers are voted up and rise to the top
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).