On the Extension Complexity of Polytopes Separating Subsets of the Boolean Cube
Pages 268 - 278
Abstract
We show that for every , there exists a polytope with and extension complexity , and that there exists an such that the extension complexity of any P with must be at least . We also remark that the extension complexity of any 0/1-polytope in is at most and pose the problem whether the upper bound can be improved to , for .
References
[1]
Alon N The number of polytopes, configurations and real matroids Mathematika 1986 33 1 62-71
[2]
Alon, N.: Tools from higher algebra. In: Handbook of Combinatorics, vol. 2, pp. 1749–1783. North Holland, Amsterdam (1995)
[3]
Aprile, M., Faenza, Yu., Fiorini, S., Huynh, T., Macchia, M.: Extension complexity of stable set polytopes of bipartite graphs. In: Graph-Theoretic Concepts in Computer Science (Eindhoven 2017). Lecture Notes in Computer Science, vol. 10520, pp. 75–87. Springer, Cham (2017)
[4]
Averkov G, Kaibel V, and Weltge S Maximum semidefinite and linear extension complexity of families of polytopes Math. Program. Ser. A 2018 167 2 381-394
[5]
Bárány I and Pór A On - polytopes with many facets Adv. Math. 2001 161 2 209-228
[6]
Carr, R.D., Konjevod, G.: Polyhedral combinatorics. In: Tutorials on Emerging Methodologies and Applications in Operations Research (Denver 2004). International Series in Operations Research & Management Science, vol. 76, pp. 2-1–2-46. Springer, New York (2005)
[7]
Dančík V Complexity of Boolean functions over bases with unbounded fan-in gates Inf. Process. Lett. 1996 57 1 31-34
[8]
Fiorini S, Kaibel V, Pashkovich K, and Theis DO Combinatorial bounds on nonnegative rank and extended formulations Discrete Math. 2013 313 1 67-83
[9]
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)
[10]
Fiorini S, Rothvoß Th, and Tiwary HR Extended formulations for polygons Discrete Comput. Geom. 2012 48 3 658-668
[11]
Göös, M.: Lower bounds for clique vs. independent set. In: 56th Annual Symposium on Foundations of Computer Science (Berkeley 2015), pp. 1066–1076. IEEE, Los Alamitos (2015)
[12]
Hrubeš, P.: On -sensitive monotone computations. Comput. Complexity 29(2), # 6 (2020)
[13]
Hrubeš, P.: On the complexity of computing a random Boolean function over the reals. Theory Comput. 16, # 9 (2020)
[14]
Jeroslow RG On defining sets of vertices of the hypercube by linear inequalities Discrete Math. 1975 11 119-124
[15]
Jukna, S.: Boolean Function Complexity. Algorithms and Combinatorics, vol. 27. Springer, Heidelberg (2012)
[16]
Jukna, S.: Computational complexity of graphs. In: Advances in Network Complexity. Quantitative and Network Biology, vol. 4, pp. 99–153. Wiley-Blackwell, Weinheim (2013)
[17]
Kaibel, V., Loos, A.: Finding descriptions of polytopes via extended formulations and liftings. In: Progress in Combinatorial Optimization, pp. 151–169. ISTE, London (2012)
[18]
Kushilevitz, E., Weinreb, E.: On the complexity of communication complexity. In: ACM International Symposium on Theory of Computing (Bethesda 2009), pp. 465–473. ACM, New York (2009)
[19]
Kwan M, Sauermann L, and Zhao Y Extension complexity of low-dimensional polytopes Trans. Am. Math. Soc. 2022 375 6 4209-4250
[20]
Maurras J-F Convex hull of the edges of a graph and near bipartite graphs Discrete Math. 1983 46 3 257-265
[21]
Pudlák P, Rödl V, and Savický P Graph complexity Acta Inform. 1988 25 5 515-535
[22]
Rothvoß Th Some polytopes need exponential size extended formulations Math. Program.Ser. A 2013 142 1–2 255-268
[23]
Shitov, Y.: Sublinear extension of polygons (2014). arXiv:1412.0728
[24]
Warren HE Lower bounds for approximation by nonlinear manifolds Trans. Am. Math. Soc. 1968 133 167-178
[25]
Yannakakis M Expressing combinatorial optimization problems by linear programs J. Comput. Syst. Sci. 1991 43 3 441-466
[26]
Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152. Springer, New York (1995)
Recommendations
Maximum semidefinite and linear extension complexity of families of polytopes
We relate the maximum semidefinite and linear extension complexity of a family of polytopes to the cardinality of this family and the minimum pairwise Hausdorff distance of its members. This result directly implies a known lower bound on the maximum ...
A generalization of extension complexity that captures P
We study a generalization of extended formulations of polytopes.Our generalization allows ignoring a subset of valid inequalities.Our generalization captures polynomial time exactly.We prove lower bounds for some example polytopes. In this paper we ...
Extension Complexity of Polytopes with Few Vertices or Facets
We study the extension complexity of polytopes with few vertices or facets. On the one hand, we provide a complete classification of $d$-polytopes with at most d+4 vertices according to their extension complexity: Out of the super-exponentially-many $d$-...
Comments
Information & Contributors
Information
Published In
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2022. Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 17 August 2022
Accepted: 22 June 2022
Revision received: 19 May 2022
Received: 25 May 2021
Author Tags
Author Tag
Qualifiers
- Research-article
Funding Sources
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 28 Jan 2025