arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.0862cs.CC
收藏

树型割平面证明的下界方法

On Lower Bound Methods for Tree-like Cutting Plane Proofs

Daniel Apon

摘要:

在Stasys Jukna的《布尔函数复杂性》一书中,提出了两种使用Karchmer-Widgerson类型的通信游戏(以下称为“KW游戏”)进行树型切割平面证明(以下称为“Tree-CP证明”)的下界技术:第一种,适用于具有有界系数的Tree-CP证明,将KW游戏上的Omega(t)确定性下界转换为Tree-CP证明大小的2^Omega(t/log n)下界。第二个,适用于具有无界系数的Tree-CP证明,将KW游戏上的Omega(t)随机下界转换为Tree-CP证明大小的2^Omega(t/log^2 n)下界。对于后一种情况,教科书上的证明对GreaterThan函数使用了O(log^2 n)位的随机化协议。然而,Nisan提到使用Feige等人的想法来为GreaterThan构造O(log n + log(1/n))位随机化协议。尼桑没有明确给出证明,尽管他的论文后来的结果假设了这样一个协议。在这个简短的阐述中,我们基于Feige等人的“噪音二分搜索”思想,为GreaterThan函数提供了完整的O(log n + log(1/epsilon))位随机协议。作为一个应用,我们展示了如何将KW游戏上的Omega(t)随机下界转换为无界系数情况下Tree-CP证明大小的2^Omega(t/log n)下界。这将随机性等同于Tree-CP/KW博弈下限方法的系数大小。我们相信,虽然GreaterThan的O(log n + log(1/n))位随机化协议是一个“已知”的结果,但这里给出的与Tree-CP证明大小下限的显式连接是新的。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑