arXiv 0902.21462009-02-12cs.CC

A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints

Kenya Ueno

发表信息：: 26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009 (2009) 433-444

英文摘要：

We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of stable set polytope. We apply it to majority functions and prove their formula size lower bounds improved from the classical result of Khrapchenko [13]. Moreover, we introduce a notion of unbalanced recursive ternary majority functions motivated by a decomposition theory of monotone self-dual functions and give integrally matching upper and lower bounds of their formula size. We also show monotone formula size lower bounds of balanced recursive ternary majority functions improved from the quantum adversary bound of Laplante, Lee and Szegedy [15].

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Model Counting for Formulas of Bounded Clique-Width

We show that #SAT is polynomial-time tractable for classes of CNF formulas whose incidence graphs have bounded symmetric clique-width (or bounded clique-width, or bounded rank-width). This result strictly generalizes polynomial-time tractability results for classes of formulas with signed incidence graphs of bounded clique-width and classes of formulas with incidence graphs of bounded modular treewidth, which were the most general results of this kind known so far.

2014-09-30cs.CCcs.DS

Finding Planted Cliques in Sublinear Time

We study the planted clique problem in which a clique of size k is planted in an Erdos-Renyi graph G(n,1/2) and one is interested in recovering this planted clique. It is widely believed that it exhibits a statistical-computational gap when computational efficiency is equated with the existence of polynomial time algorithms. We study this problem under a more fine-grained computational lens and consider the following two questions. 1. Do there exist sublinear time algorithms for recovering the planted clique? 2. What is the smallest running time any algorithm can hope to have? We show that bec…

2022-10-17cs.CCcs.DScs.IT

二进制编码的 clique 在证明和通信复杂性中的平均情况难度

Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity

研究在证明和通信复杂性中确定图中无大 clique 的平均情况难度，证明了切割平面和有限深度解析 over parities 的 refutations 长度的指数下界，并显示在这些公式中寻找被否决子句的随机通信复杂度为多项式。

2026-05-11cs.CC

用于解析的硬团公式

Hard Clique Formulas for Resolution

该研究将稀疏且解析难的3-CNF公式转换为k-团问题，证明其在解析中的硬度，解决了k-团问题的开放难题。

2026-01-26cs.CCcs.LO

An Alternative Proof of the Exponential Monotone Complexity of the Clique Function

In 1985, Razborov discovered a proof that the monotone circuit complexity of the clique problem is super-polynomial. Alon and Boppana improved the result into exponential lower bound exp(Ω(n / \log n)^{1/3})) of a monotone circuit C to compute cliques of size (1/4) (n / log n)^{2/3}, where n is the number of vertices in a graph. Both proofs are based on the method of approximations and Erdos and Rado's sunflower lemma. There has been an interest in further generalization of the proof scheme. In this paper, we present a new approach to show the exponential monotone complexity. Unlike the standa…

2013-09-08cs.CCmath.CO

单调电路的团近似问题的难度

Hardness of clique approximation for monotone circuits

本研究结合向日葵猜想突破成果，改进了单调电路近似团问题的下界至$2^{\u000btildeΩ(\u221an)}$，并构造了对应显式电路，阐明了可与随机图区分的最大团规模的电路复杂度分界。

2025-01-16cs.CC

更多相关论文收起更多论文

Sum-of-squares lower bounds for planted clique

Finding cliques in random graphs and the closely related "planted" clique variant, where a clique of size k is planted in a random G(n, 1/2) graph, have been the focus of substantial study in algorithm design. Despite much effort, the best known polynomial-time algorithms only solve the problem for k ~ sqrt(n). In this paper we study the complexity of the planted clique problem under algorithms from the Sum-of-squares hierarchy. We prove the first average case lower bound for this model: for almost all graphs in G(n,1/2), r rounds of the SOS hierarchy cannot find a planted k-clique unless k > …

2015-03-22cs.CCcs.DSmath.CO

Association schemes, non-commutative polynomial concentration, and sum-of-squares lower bounds for planted clique

Finding cliques in random graphs and the closely related "planted" clique variant, where a clique of size t is planted in a random G(n,1/2) graph, have been the focus of substantial study in algorithm design. Despite much effort, the best known polynomial-time algorithms only solve the problem for t = Theta(sqrt(n)). Here we show that beating sqrt(n) would require substantially new algorithmic ideas, by proving a lower bound for the problem in the sum-of-squares (or Lasserre) hierarchy, the most powerful class of semi-definite programming algorithms we know of: r rounds of the sum-of-squares h…

2013-11-13cs.CCcs.DSmath.CO

Circuit Lower Bounds for the p-Spin Optimization Problem

We consider the problem of finding a near ground state of a $p$-spin model with Rademacher couplings by means of a low-depth circuit. As a direct extension of the authors' recent work [Gamarnik, Jagannath, Wein 2020], we establish that any poly-size $n$-output circuit that produces a spin assignment with objective value within a certain constant factor of optimality, must have depth at least $\log n/(2\log\log n)$ as $n$ grows. This is stronger than the known state of the art bounds of the form $Ω(\log n/(k(n)\log\log n))$ for similar combinatorial optimization problems, where $k(n)$ depends o…

2022-01-21cs.CCmath.PR

Parameterized Compilation Lower Bounds for Restricted CNF-formulas

CNRS（法国国家科学研究中心）；CRIL（朗斯信息学研究所）

We show unconditional parameterized lower bounds in the area of knowledge compilation, more specifically on the size of circuits in decomposable negation normal form (DNNF) that encode CNF-formulas restricted by several graph width measures. In particular, we show that - there are CNF formulas of size $n$ and modular incidence treewidth $k$ whose smallest DNNF-encoding has size $n^{Ω(k)}$, and - there are CNF formulas of size $n$ and incidence neighborhood diversity $k$ whose smallest DNNF-encoding has size $n^{Ω(\sqrt{k})}$. These results complement recent upper bounds for compiling CNF into …

2016-04-22cs.AIcs.CC

尖锐阈值蕴含电路下界：从随机2-SAT到植入团问题

Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique

该研究证明布尔函数尖锐阈值蕴含平均情形有界深度电路下界，给出逆命题，并在k-团、随机2-SAT、植入k-团等场景推导出新的指数级电路规模下界。

2024-07-16cs.CCmath.PRmath.ST