On the Extension Complexity of Polytopes Separating Subsets of the Boolean Cube
- 17 August 2022
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 70 (1) , 268-278
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Grantová Agentura České Republiky (19-27871X)
This publication has 22 references indexed in Scilit:
- Computational Complexity of Graphs2013
- Combinatorial bounds on nonnegative rank and extended formulationsDiscrete Mathematics, 2013
- Extended Formulations for PolygonsDiscrete & Computational Geometry, 2012
- On 0-1 Polytopes with Many FacetsAdvances in Mathematics, 2001
- Complexity of Boolean functions over bases with unbounded fan-in gatesInformation Processing Letters, 1996
- Expressing combinatorial optimization problems by Linear ProgramsJournal of Computer and System Sciences, 1991
- The number of polytopes, configurations and real matroidsMathematika, 1986
- Convex hull of the edges of a graph and near bipartite graphsDiscrete Mathematics, 1983
- On defining sets of vertices of the hypercube by linear inequalitiesDiscrete Mathematics, 1975
- Lower bounds for approximation by nonlinear manifoldsTransactions of the American Mathematical Society, 1968