Are there any known NP-hard problems that are easy on average as per the definition of average-case complexity by Levin?
NP-hard problems which are easy on average
1
$\begingroup$
computational-complexity
np-complete