Author:
Bennett Patrick,Bonacina Ilario,Galesi Nicola,Huynh Tony,Molloy Mike,Wollan Paul
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference27 articles.
1. Space complexity in propositional calculus;Alekhnovich;SIAM J. Comput.,2002
2. A combinatorial characterization of resolution width;Atserias;J. Comput. Syst. Sci.,2008
3. On sufficient conditions for unsatisfiability of random formulas;Atserias;J. ACM,2004
4. Patrick Bennett, Ilario Bonacina, Nicola Galesi, Tony Huynh, Mike Molloy, Paul Wollan, Space proof complexity for random 3-cnfs, March 2015.
5. Size space tradeoffs for resolution;Ben-Sasson,2002
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Chapter 7. Proof Complexity and SAT Solving;Frontiers in Artificial Intelligence and Applications;2021-02-02
2. Supercritical Space-Width Trade-offs for Resolution;SIAM Journal on Computing;2020-01
3. Tree matchings;Journal of Graph Theory;2019-11-27