On the extension complexity of polytopes separating subsets of the Boolean cube
From MaRDI portal
Publication:6156096
DOI10.1007/s00454-022-00419-3arXiv2105.11996OpenAlexW3165098550WikidataQ114229291 ScholiaQ114229291MaRDI QIDQ6156096
No author found.
Publication date: 12 June 2023
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2105.11996
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Convex hull of the edges of a graph and near bipartite graphs
- Boolean function complexity. Advances and frontiers.
- Extended formulations for polygons
- Expressing combinatorial optimization problems by linear programs
- On defining sets of vertices of the hypercube by linear inequalities
- Complexity of Boolean functions over bases with unbounded fan-in gates
- Extension complexity of stable set polytopes of bipartite graphs
- Maximum semidefinite and linear extension complexity of families of polytopes
- Combinatorial bounds on nonnegative rank and extended formulations
- Graph complexity
- Tutorials on emerging methodologies and applications in operations research. Selected papers presented at INFORMS 2004, Denver, CO, USA, October 24--27, 2004.
- On \(\epsilon\)-sensitive monotone computations
- Some \(0/1\) polytopes need exponential size extended formulations
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization
- Finding Descriptions of Polytopes via Extended Formulations and Liftings
- Computational Complexity of Graphs
- The number of polytopes, configurations and real matroids
- Lectures on Polytopes
- Extension complexity of low-dimensional polytopes
- On the complexity of communication complexity
- Lower Bounds for Approximation by Nonlinear Manifolds
- On 0-1 polytopes with many facets
This page was built for publication: On the extension complexity of polytopes separating subsets of the Boolean cube
