Subject
General Computer Science,Theoretical Computer Science
Reference22 articles.
1. A. Atserias, M.L. Bonet, On the automatizability of resolution and related propositional proof systems, in: Computer Science Logic, 16th International Workshop, 2002, pp. 569–583
2. Non-automatizability of bounded-depth Frege proofs;Bonet;Computational Complexity,2004
3. Lower bounds for cutting planes proofs with small coefficients;Bonet;The Journal of Symbolic Logic,1997
4. On interpolation and automatization for Frege systems;Bonet;SIAM Journal on Computing,2000
5. The relative efficiency of propositional proof systems;Cook;The Journal of Symbolic Logic,1979
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献