A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector (Q1983109)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A geometric lower bound on the extension complexity of polytopes based on the f-vector |
scientific article; zbMATH DE number 7395725
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector |
scientific article; zbMATH DE number 7395725 |
Statements
A geometric lower bound on the extension complexity of polytopes based on the \(f\)-vector (English)
0 references
15 September 2021
0 references
combinatorial optimization
0 references
convex polytopes
0 references
linear extension
0 references
extended formulation
0 references
extension complexity
0 references
lower bound
0 references
\(f\)-vector
0 references
slack matrices
0 references
nonnegative matrix factorization
0 references
nonnegative rank
0 references
restricted nonnegative rank
0 references
0 references
0 references
0.8393619656562805
0 references
0.8120740056037903
0 references
0.7934068441390991
0 references
0.7928343415260315
0 references
0.7897881269454956
0 references
