对所有常度图Tseitin公式正则分辨率反驳的近似最优下界的修正

IF 0.7 3区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Computational Complexity Pub Date : 2021-11-17 DOI:10.1007/s00037-021-00216-z

D. Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov

引用次数: 3

摘要

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Computational Complexity 数学-计算机：理论方法

CiteScore

1.50

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： computational complexity presents outstanding research in computational complexity. Its subject is at the interface between mathematics and theoretical computer science, with a clear mathematical profile and strictly mathematical format. The central topics are: Models of computation, complexity bounds (with particular emphasis on lower bounds), complexity classes, trade-off results for sequential and parallel computation for "general" (Boolean) and "structured" computation (e.g. decision trees, arithmetic circuits) for deterministic, probabilistic, and nondeterministic computation worst case and average case Specific areas of concentration include: Structure of complexity classes (reductions, relativization questions, degrees, derandomization) Algebraic complexity (bilinear complexity, computations for polynomials, groups, algebras, and representations) Interactive proofs, pseudorandom generation, and randomness extraction Complexity issues in: crytography learning theory number theory logic (complexity of logical theories, cost of decision procedures) combinatorial optimization and approximate Solutions distributed computing property testing.