A combinatorial characterization of resolution width-Reference-Cited by-同舟云学术

A combinatorial characterization of resolution width

Published:2008-05 Issue:3 Volume:74 Page:323-334
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Atserias Albert,Dalmau Víctor

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference29 articles.

1. Space complexity in propositional calculus;Alekhnovich;SIAM J. Comput.,2002

2. M. Alekhnovich, A. Razborov, Satisfiability, branch-width and Tseitin tautologies, in: 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 593–603

3. M. Alekhnovich, A.A. Razborov, Resolution is not automatizable unless W[P] is tractable, in: 42nd Annual IEEE Symposium on Foundations of Computer Science, 2001, pp. 210–219

4. Pseudorandom generators in propositional proof complexity;Alekhnovich;SIAM J. Comput.,2004

5. Unsatisfiable random formulas are hard to certify;Atserias;J. ACM,2004

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

1. Resolution Over Linear Equations: Combinatorial Games for Tree-like Size and Space;ACM Transactions on Computation Theory;2024-09-09

2. A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds;Journal of the ACM;2024-07-04

3. Proof Complexity and the Binary Encoding of Combinatorial Principles;SIAM Journal on Computing;2024-06-24

4. How Random CSPs Fool Hierarchies;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

5. Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06