par Avis, David;Tiwary, Hans Raj 
Référence Lecture notes in computer science, 7965 LNCS, PART 1, page (57-68)
Publication Publié, 2013
Référence Lecture notes in computer science, 7965 LNCS, PART 1, page (57-68)
Publication Publié, 2013
Article révisé par les pairs
| Résumé : | In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete problems including subset-sum and three dimensional matching. We then obtain a relationship between the extension complexity of the cut polytope of a graph and that of its graph minors. Using this we are able to show exponential extension complexity for the cut polytope of a large number of graphs, including those used in quantum information and suspensions of cubic planar graphs. © 2013 Springer-Verlag. |
