Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1301.0862

On Lower Bound Methods for Tree-like Cutting Plane Proofs

Daniel Apon
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the book Boolean Function Complexity by Stasys Jukna, two lower bound techniques for Tree-like Cutting Plane proofs (henceforth, "Tree-CP proofs") using Karchmer-Widgerson type communication games (henceforth, "KW games") are presented: The first, applicable to Tree-CP proofs with bounded coefficients, translates Omega(t) deterministic lower bounds on KW games to 2^Omega(t/log n) lower bounds on Tree-CP proof size. The second, applicable to Tree-CP proofs with unbounded coefficients, translates Omega(t) randomized lower bounds on KW games to 2^Omega(t/log^2 n) lower bounds on Tree-CP proof size. The textbook proof in the latter case uses a O(log^2 n)-bit randomized protocol for the GreaterThan function. However, Nisan mentioned using the ideas of Feige, et al. to construct a O(log n + log(1/epsilon))-bit randomized protocol for GreaterThan. Nisan did not explicitly give the proof, though later results in his paper assume such a protocol. In this short exposition, we present the full O(log n + log(1/epsilon))-bit randomized protocol for the GreaterThan function based on the ideas of Feige, et al. for "noisy binary search." As an application, we show how to translate Omega(t) randomized lower bounds on KW games to 2^Omega(t/log n) lower bounds on Tree-CP proof size in the unbounded coefficient case. This equates randomness with coefficient size for the Tree-CP/KW game lower bound method. We believe that, while the O(log n + log(1/epsilon))-bit randomized protocol for GreaterThan is a "known" result, the explicit connection to Tree-CP proof size lower bounds given here is new.

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

Daniel Apon. 2013-01-05. On Lower Bound Methods for Tree-like Cutting Plane Proofs. https://arxiv.org/abs/1301.0862

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗