28 citations · 29 across the 13 of their papers we have counts for
1 paper · 1 filter
Moustapha Diaby
Using an approach that seems to be patterned after that of Yannakakis, Hofman argues that an NP-complete problem cannot be formulated as a polynomial bounded-sized linear programmi…