Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Atserias, A., Bonet, M.L.: On the automatizability of resolution and related propositional proof systems. In: Computer Science Logic, 16th International Workshop, pp. 569–583 (2002)
2. Beyersdorff, O.: Representable disjoint NP-pairs. In: Proc. 24th Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 122–134 (2004)
3. Beyersdorff, O.: Disjoint NP-pairs from propositional proof systems. Technical Report TR05-083, Electronic Colloquium on Computational Complexity (2005)
4. Bonet, M.L., Pitassi, T., Raz, R.: Lower bounds for cutting planes proofs with small coefficients. The Journal of Symbolic Logic 62(3), 708–728 (1997)
5. Bonet, M.L., Pitassi, T., Raz, R.: On interpolation and automatization for Frege systems. SIAM Journal on Computing 29(6), 1939–1967 (2000)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Tuples of Disjoint NP-Sets;Computer Science – Theory and Applications;2006
2. The Informational Content of Canonical Disjoint NP-Pairs;Lecture Notes in Computer Science