首页    期刊浏览 2024年10月06日 星期日
登录注册

文章基本信息

  • 标题:Random CNFs are Hard for Cutting Planes
  • 本地全文:下载
  • 作者:Noah Fleming ; Denis Pankratov ; Toniann Pitassi
  • 期刊名称:Electronic Colloquium on Computational Complexity
  • 印刷版ISSN:1433-8092
  • 出版年度:2017
  • 卷号:2017
  • 出版社:Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
  • 摘要:

    The random k-SAT model is the most important and well-studied distribution over k-SAT instances. It is closely connected to statistical physics and is a benchmark for satisfiability algorithms. In this paper, we prove that any Cutting Planes refutation for random k-SAT requires exponential size, for k that is logarithmic in the number of variables, and in the interesting regime where the number of clauses guarantees that the formula is unsatisfiable with high probability.

国家哲学社会科学文献中心版权所有