Extension Complexity of Independent Set Polytopes

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.

[1]  Tim Roughgarden,et al.  Communication Complexity (for Algorithm Designers) , 2015, Found. Trends Theor. Comput. Sci..

[2]  Ran Raz,et al.  Monotone circuits for matching require linear depth , 1990, STOC '90.

[3]  Avi Wigderson,et al.  Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.

[4]  Hans Raj Tiwary,et al.  On the extension complexity of combinatorial polytopes , 2013, Math. Program..

[5]  Jakob Nordström,et al.  On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity , 2012, STOC '12.

[6]  Jakob Nordstr,et al.  New Wine into Old Wineskins: A Survey of Some Pebbling Classics with Supplemental Results , 2015 .

[7]  Thomas Rothvoß,et al.  Some 0/1 polytopes need exponential size extended formulations , 2011, Math. Program..

[8]  G. Nemhauser,et al.  Integer Programming , 2020 .

[9]  Moni Naor,et al.  Search problems in the decision tree model , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[10]  Ziv Bar-Yossef,et al.  An information statistics approach to data stream and communication complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[11]  Alexander A. Sherstov.  The Pattern Matrix Method , 2009, SIAM J. Comput..

[12]  H. Buhrman,et al.  Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..

[13]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[14]  M. Ziegler.  Volume 152 of Graduate Texts in Mathematics , 1995 .

[15]  Stasys Jukna,et al.  Boolean Function Complexity Advances and Frontiers , 2012, Bull. EATCS.

[16]  Pavel Hrubes,et al.  On the nonnegative rank of distance matrices , 2012, Inf. Process. Lett..

[17]  Alexander A. Razborov,et al.  Applications of matrix methods to the theory of lower bounds in computational complexity , 1990, Comb..

[18]  Sebastian Pokutta,et al.  The matching polytope does not admit fully-polynomial size relaxation schemes , 2015, SODA.

[19]  Prasad Raghavendra,et al.  Lower Bounds on the Size of Semidefinite Programming Relaxations , 2014, STOC.

[20]  Mihalis Yannakakis,et al.  Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.

[21]  Alan M. Frieze,et al.  Optimal construction of edge-disjoint paths in random regular graphs , 2000, SODA '99.

[22]  Hans Raj Tiwary,et al.  Exponential Lower Bounds for Polytopes in Combinatorial Optimization , 2011, J. ACM.

[23]  Mark Braverman,et al.  An information complexity approach to extended formulations , 2013, STOC '13.

[24]  Sebastian Pokutta,et al.  A note on the extension complexity of the knapsack polytope , 2013, Oper. Res. Lett..

[25]  Anna Gál.  A characterization of span program size and improved lower bounds for monotone span programs , 1998, STOC '98.

[26]  Sebastian Pokutta,et al.  Common Information and Unique Disjointness , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[27]  I. Oliveira.  Unconditional Lower Bounds in Complexity Theory , 2015 .

[28]  V. Kaibel.  Extended Formulations in Combinatorial Optimization , 2011, 1104.1023.

[29]  Thomas Rothvoß,et al.  The matching polytope has exponential extension complexity , 2013, STOC.

[30]  Hans Raj Tiwary,et al.  Extended formulations, nonnegative factorizations, and randomized communication protocols , 2011, Mathematical Programming.

[31]  Rahul Jain,et al.  Extension Complexity of Independent Set Polytopes , 2018, SIAM J. Comput..

[32]  Alan M. Frieze.  Edge-disjoint paths in expander graphs , 2000, SODA '00.

[33]  A. Razborov.  Communication Complexity , 2011 .

[34]  László Lovász,et al.  Interactive proofs and the hardness of approximating cliques , 1996, JACM.

[35]  Prasad Raghavendra,et al.  Approximate Constraint Satisfaction Requires Large LP Relaxations , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[36]  Toniann Pitassi,et al.  Communication lower bounds via critical block sensitivity , 2013, STOC.

[37]  Shachar Lovett,et al.  Rectangles Are Nonnegative Juntas , 2015, SIAM J. Comput..