Funder
Grantová Agentura České Republiky
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference27 articles.
1. Fiorini, S., Massar, S., Pokutta, S., Tiwary, H. R., de Wolf, R.: Exponential lower bounds for polytopes in combinatorial optimization. J. ACM 62 (2), 17 (2015).
https://doi.org/10.1145/2716307
2. Avis, D., Tiwary, H. R.: On the extension complexity of combinatorial polytopes. Math. Program. 153(1), 95–115 (2015).
https://doi.org/10.1007/s10107-014-0764-2
3. Rothvoß, T.: The matching polytope has exponential extension complexity. J. ACM 64(6), 41:1–41:19 (2017).
https://doi.org/10.1145/3127497
4. Braun, G., Jain, R., Lee, T., Pokutta, S.: Information-theoretic approximations of the nonnegative rank, ECCC:158 (2013)
5. Chan, S. O., Lee, J. R., Raghavendra, P., Steurer, D.: Approximate constraint satisfaction requires large LP relaxations. In: FOCS ’13, 2013, pp. 350–359.
https://doi.org/10.1109/FOCS.2013.45