Author:
Lauria Massimo,Pudlák Pavel,Rödl Vojtěch,Thapen Neil
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference18 articles.
1. M. Alekhnovich, E. Ben-Sasson, A. A. Razborov and A. Wigderson: Pseudorandom generators in propositional proof complexity, SIAM Journal on Computing, 34 (2004), 67–88, a preliminary version appeared in FOCS ’00.
2. A. Atserias and V. Dalmau: A combinatorial characterization of resolution width, J. Comput. Syst. Sci., 74 (2008), 323–334.
3. A. Atserias, J. K. Fichte and M. Thurley: Clause-learning algorithms with many restarts and bounded-width resolution, J. Artif. Intell. Res. (JAIR), 40 (2011), 353–373.
4. E. Ben-Sasson and A. Wigderson: Short proofs are narrow - resolution made simple, in: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 517–526, 1999.
5. O. Beyersdorff, N. Galesi and M. Lauria: Parameterized complexity of DPLL search procedures, ACM Transactions on Computational Logic, 14 (2013), 1–21.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献