期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2016
卷号：2016
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：We exhibit an n -node graph whose independent set polytope requires extended formulations of size exponential in ( n log n ) . Previously, no explicit examples of n -dimensional 0 1 -polytopes were known with extension complexity larger than exponential in ( n ) . Our construction is inspired by a relatively little-known connection between extended formulations and (monotone) circuit depth.
