arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2012.09476cs.CC
收藏

正则归结的团平均困难性

Clique Is Hard on Average for Regular Resolution

Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander Razborov

摘要:

我们证明了对于$k \ll \sqrt[4]{n}$正则分解需要长度$n^{Ω(k)}$来建立具有适当选择的边密度的Erdens-Rényi图不包含$k$ -团。这个下限是最佳的乘法常数的指数,也意味着无条件的$n^{Ω(k)}$运行时间的几个国家的最先进的算法,在图中找到最大集团的下限。

英文摘要:

We prove that for $k \ll \sqrt[4]{n}$ regular resolution requires length $n^{Ω(k)}$ to establish that an Erdős-Rényi graph with appropriately chosen edge density does not contain a $k$-clique. This lower bound is optimal up to the multiplicative constant in the exponent, and also implies unconditional $n^{Ω(k)}$ lower bounds on running time for several state-of-the-art algorithms for finding maximum cliques in graphs.

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

↑