Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Achlioptas, D.: Random satisfiability. In: Handbook of Satisfiability, pp. 245–270 (2009)
2. Alekhnovich, M., Razborov, A.A.: Resolution is not automatizable unless W[P] is tractable. SIAM J. Comput. 38(4), 1347–1363 (2008)
3. Atserias, A., Bonet, M.L.: On the automatizability of resolution and related propositional proof systems. Information and Computation 189, 182–201 (2004)
4. Lecture Notes in Computer Science;A. Atserias,2010
5. Beckmann, A., Pudlák, P., Thapen, N.: Parity games and propositional proofs. ACM Transactions on Computational Logic (to appear)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献