62 citations · 134 across the 12 of their papers we have counts for
1 paper · 1 filter
Leonid A. Levin, Ramarathnam Venkatesan
NP-complete problems should be hard on some instances but those may be extremely rare. On generic instances many such problems, especially related to random graphs, have been prove…