arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.06805cs.CCcs.FL
收藏

基于ETH的超线性下界

Superlinear Lower Bounds Based on ETH

András Z. Salamon, Michael Wehar

摘要:

我们介绍了技术证明超线性条件下界的多项式时间的问题。特别是,我们表明,电路与m门和log(m)的输入(表示为log-CircuitSAT)的CircuitSAT是不可判定的本质线性时间,除非指数时间假设(ETH)是假的,k-团是可判定的本质线性时间在图的大小为所有固定的k。这样的条件下限以前只被证明相对于强指数时间假设(SETH)。因此,我们的研究结果提供了显着的进展,证明无条件的超线性时间复杂度下限自然问题的多项式时间。

英文摘要:

We introduce techniques for proving superlinear conditional lower bounds for polynomial time problems. In particular, we show that CircuitSAT for circuits with m gates and log(m) inputs (denoted by log-CircuitSAT) is not decidable in essentially-linear time unless the exponential time hypothesis (ETH) is false and k-Clique is decidable in essentially-linear time in terms of the graph's size for all fixed k. Such conditional lower bounds have previously only been demonstrated relative to the strong exponential time hypothesis (SETH). Our results therefore offer significant progress towards proving unconditional superlinear time complexity lower bounds for natural problems in polynomial time.

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

↑