Maximum semidefinite and linear extension complexity of families of polytopes
暂无分享,去创建一个
[1] Egon Börger,et al. Logic and Machines: Decision Problems and Complexity , 1984, Lecture Notes in Computer Science.
[2] Arnau Padrol. Polytopes with few vertices and few facets , 2016, J. Comb. Theory, Ser. A.
[3] Claus Scheiderer. Convex hulls of curves of genus one , 2010 .
[4] Volker Kaibel,et al. A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially , 2013, Discret. Comput. Geom..
[5] Thomas Rothvoß,et al. The matching polytope has exponential extension complexity , 2013, STOC.
[6] J. William Helton,et al. Semidefinite Representation of Convex Sets and Convex Hulls , 2012 .
[7] Yaroslav Shitov. Sublinear extensions of polygons , 2014 .
[8] Rekha R. Thomas,et al. Lifts of Convex Sets and Cone Factorizations , 2011, Math. Oper. Res..
[9] J. Helton,et al. Linear matrix inequality representation of sets , 2003, math/0306180.
[10] Hans Raj Tiwary,et al. Extended Formulations for Polygons , 2011, Discret. Comput. Geom..
[11] J. William Helton,et al. Semidefinite representation of convex sets , 2007, Math. Program..
[12] Hans Raj Tiwary,et al. On the extension complexity of combinatorial polytopes , 2015, Math. Program..
[13] Aaron D. Wyner,et al. The Synthesis of TwoTerminal Switching Circuits , 1993 .
[14] Sebastian Pokutta,et al. On the existence of 0/1 polytopes with high semidefinite extension complexity , 2015, Math. Program..
[15] V. Kaibel. Extended Formulations in Combinatorial Optimization , 2011, 1104.1023.
[16] Prasad Raghavendra,et al. Lower Bounds on the Size of Semidefinite Programming Relaxations , 2014, STOC.
[17] Mihalis Yannakakis,et al. Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.
[18] J. Graver,et al. Graduate studies in mathematics , 1993 .
[19] Hans Raj Tiwary,et al. Exponential Lower Bounds for Polytopes in Combinatorial Optimization , 2011, J. ACM.
[20] Michel X. Goemans,et al. Smallest compact formulation for the permutahedron , 2015, Math. Program..
[21] L. Lovász,et al. Annals of Discrete Mathematics , 1986 .
[22] J. Lasserre,et al. Handbook on Semidefinite, Conic and Polynomial Optimization , 2012 .
[23] Thomas Rothvoß,et al. Some 0/1 polytopes need exponential size extended formulations , 2011, Math. Program..
[24] Alexander Barvinok,et al. A course in convexity , 2002, Graduate studies in mathematics.
[25] Claude E. Shannon,et al. The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..
[26] Arnau Padrol,et al. Extension Complexity of Polytopes with Few Vertices or Facets , 2016, SIAM J. Discret. Math..
[27] Rekha R. Thomas,et al. Positive semidefinite rank , 2014, Math. Program..
[28] Jan van Leeuwen,et al. The VLSI complexity of Boolean functions , 1983, Logic and Machines.
[29] Sebastian Pokutta,et al. A note on the extension complexity of the knapsack polytope , 2013, Oper. Res. Lett..