Satisfiability, Branch-Width and Tseitin tautologies-Reference-Cited by-同舟云学术

Satisfiability, Branch-Width and Tseitin tautologies

Published:2011-11-25 Issue:4 Volume:20 Page:649-678
ISSN:1016-3328
Container-title:computational complexity
language:en
Short-container-title:comput. complex.

Author:

Alekhnovich Michael,Razborov Alexander

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s00037-011-0033-1.pdf

Reference25 articles.

1. M. Alekhnovich (2004). Mutilated chessboard problem is exponentially hard for resolution. Theoretical Computer Science 310(1-3), 513–525.

2. Alekhnovich M., Ben-Sasson E., Razborov A., Wigderson A. (2004) Pseudorandom generators in propositional proof complexity. SIAM Journal on Computing 34(1): 67–88

3. M. Alekhnovich & A. Razborov (2003). Lower bounds for the polynomial calculus: non-binomial case. Proceedings of the Steklov Institute of Mathematics 242, 18-35.

4. Alekhnovich M., Razborov A. (2008) Resolution is not automatizable unless W[P] is tractable. SIAM Journal on Computing 38(4): 1347–1363

5. Alon N., Boppana R. (1987) The monotone circuit complexity of Boolean functions. Combinatorica 7(1): 1–22

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bounded-depth Frege complexity of Tseitin formulas for all graphs;Annals of Pure and Applied Logic;2023-01

2. Reflections on Proof Complexity and Counting Principles;Outstanding Contributions to Logic;2021-09-25

3. Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs;computational complexity;2021-08-27

4. On Treewidth, Separators and Yao’s Garbling;Theory of Cryptography;2021

5. On the Hierarchical Community Structure of Practical Boolean Formulas;Theory and Applications of Satisfiability Testing – SAT 2021;2021