Name
Title | ||
|---|---|---|
How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity) |
Abstract | ||
|---|---|---|
We obtain the first true size-space trade-offs for the cutting planes proof system, where the upper bounds hold for size and total space for derivations with constantsize coefficients, and the lower bounds apply to length and formula space (i.e., number of inequalities in memory) even for derivations with exponentially large coefficients. These are also the first trade-offs to hold uniformly for resolution, polynomial calculus and cutting planes, thus capturing the main methods of reasoning used in current state-of-the-art SAT solvers. We prove our results by a reduction to communication lower bounds in a round-efficient version of the real communication model of [Kraj́ĩcek '98], drawing on and extending techniques in [Raz and McKenzie '99] and [G̈öos et al. '15]. The communication lower bounds are in turn established by a reduction to trade-offs between cost and number of rounds in the game of [Dymond and Tompa '85] played on directed acyclic graphs. As a by-product of the techniques developed to show these proof complexity trade-off results, we also obtain an exponential separation between monotone-AC
<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i-1</sup>
and monotone-AC
<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</sup>
, improving exponentially over the superpolynomial separation in [Raz and McKenzie '99]. That is, we give an explicit Boolean function that can be computed by monotone Boolean circuits of depth log
<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</sup>
n and polynomial size, but for which circuits of depth O(log
<sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i-1</sup>
n) require exponential size. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/FOCS.2016.40 | 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) |
Keywords | Field | DocType |
proof complexity, communication complexity, circuit | Boolean function,Discrete mathematics,Combinatorics,Boolean circuit,Polynomial,Circuit complexity,Communication complexity,Directed acyclic graph,Proof complexity,Monotone polygon,Mathematics | Conference |
Volume | ISSN | ISBN |
28 | 0272-5428 | 978-1-5090-3934-0 |
Citations | PageRank | References |
1 | 0.35 | 26 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Susanna F. de Rezende | 1 | 13 | 4.35 |
| Jakob Nordström | 2 | 177 | 21.76 |
| Marc Vinyals | 3 | 28 | 4.91 |