of average-case complexity, an emergent (at the time) and fundamental area of computational complexity initiated in a seminal work of Levin [25], which aims to characterize problems which are not only hard for a worst-case choice of inputs, but also for natural distributions over the inputs...