A generalization of extension complexity that captures P (Q2345857)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6438111
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A generalization of extension complexity that captures P |
scientific article; zbMATH DE number 6438111 |
Statements
A generalization of extension complexity that captures P (English)
0 references
21 May 2015
0 references
combinatorial problems
0 references
computational complexity
0 references
theory of computation
0 references
polytopes
0 references
extended formulations
0 references
extension complexity
0 references
lower bounds
0 references
linear programming
0 references
0 references
0.80867999792099
0 references
