A Reply to Hofman On: "Why LP cannot solve large instances of NP-complete problems in polynomial time"

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…