Karp, Richard M. Papadimitriou, Christos H. (1980-02)
We show that there can be no computationally tractable description by linear inequalities of the polyhedron associated with any NP-complete combinatorial optimization problem unless NP=co-NP -- a very unlikely event. We ...