12 - Extension Complexity of Polytopes
from Part II - Applications
Published online by Cambridge University Press: 30 January 2020
Summary
Introduction to polytopes and their connectionto algorithms. Equivalence between extensioncomplexity and nonnegative rank. Lower bounds onextension complexity.
- Type
- Chapter
- Information
- Communication Complexityand Applications, pp. 210 - 238Publisher: Cambridge University PressPrint publication year: 2020