On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity
暂无分享,去创建一个
[1] Samuel Fiorini,et al. Approximation Limits of Linear Programs (Beyond Hierarchies) , 2015, Math. Oper. Res..
[2] Thomas Rothvoß,et al. Some 0/1 polytopes need exponential size extended formulations , 2011, Math. Program..
[3] Mihalis Yannakakis,et al. Expressing Combinatorial Optimization Problems by Linear Programs (Extended Abstract) , 1988, Symposium on the Theory of Computing.
[4] Joseph H. Silverman,et al. Diophantine Geometry: An Introduction , 2000 .
[5] Arkadi Nemirovski,et al. On Polyhedral Approximations of the Second-Order Cone , 2001, Math. Oper. Res..
[6] Mark Braverman,et al. An information complexity approach to extended formulations , 2013, STOC '13.
[7] Thomas Rothvoß,et al. The matching polytope has exponential extension complexity , 2013, STOC.
[8] Claude E. Shannon,et al. The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..
[9] Tosio Kato. Perturbation theory for linear operators , 1966 .
[10] Hans Raj Tiwary,et al. Extended formulations, nonnegative factorizations, and randomized communication protocols , 2011, Mathematical Programming.
[11] Rekha R. Thomas,et al. Lifts of Convex Sets and Cone Factorizations , 2011, Math. Oper. Res..
[12] G. Ziegler. Lectures on 0/1-Polytopes , 1999, math/9909177.
[13] Hans Raj Tiwary,et al. Extended Formulations for Polygons , 2011, Discret. Comput. Geom..
[14] M. Yannakakis. Expressing combinatorial optimization problems by linear programs , 1991, Symposium on the Theory of Computing.
[15] Hans Raj Tiwary,et al. Exponential Lower Bounds for Polytopes in Combinatorial Optimization , 2011, J. ACM.
[16] Michel X. Goemans,et al. Smallest compact formulation for the permutahedron , 2015, Math. Program..
[17] Sebastian Pokutta,et al. Common Information and Unique Disjointness , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[18] F. John. Extremum Problems with Inequalities as Subsidiary Conditions , 2014 .