A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially
暂无分享,去创建一个
[1] A. Razborov. Communication Complexity , 2011 .
[2] Ronald de Wolf,et al. Nondeterministic Quantum Query and Communication Complexities , 2003, SIAM J. Comput..
[3] Stasys Jukna,et al. Boolean Function Complexity Advances and Frontiers , 2012, Bull. EATCS.
[4] Alexander A. Razborov,et al. On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..
[5] Sebastian Pokutta,et al. Common Information and Unique Disjointness , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[6] Hans Raj Tiwary,et al. On the extension complexity of combinatorial polytopes , 2013, Math. Program..
[7] Thomas Rothvoß,et al. The matching polytope has exponential extension complexity , 2013, STOC.
[8] Mihalis Yannakakis,et al. Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.
[9] Sebastian Pokutta,et al. A note on the extension complexity of the knapsack polytope , 2013, Oper. Res. Lett..