19 citations · 26 across the 5 of their papers we have counts for
1 paper · 1 filter
Andrej Bogdanov, Luca Trevisan
We survey the average-case complexity of problems in NP. We discuss various notions of good-on-average algorithms, and present completeness results due to Impagliazzo and Levin. Su…