Author:
Esteban Juan Luis,Galesi Nicola,Messner Jochen
Subject
General Computer Science,Theoretical Computer Science
Reference33 articles.
1. Space complexity in propositional calculus;Alekhnovich;SIAM J. Comput.,2002
2. M. Alekhnovich, A.A. Razborov, Resolution is not automatizable unless W[P] is not tractable, Fortysecond IEEE Symp. on Foundations of Computer Science, FOCS 2001, pp. 210–219.
3. A. Atserias, M.L. Bonet, On the automatizability of resolution and related propositional proof systems, Computer Science Logic, CSL 2002, Lecture Notes in Computer Science, Vol. 2471, Springer, Berlin, pp. 569–583.
4. Lower bounds for the weak pigeonhole principle beyond resolution;Atserias;Inform. and Comput.,2002
5. A. Atserias, V. Dalmau, A combinatorial characterization of resolution width, Proc. 18th Annual IEEE Conf. on Computational Complexity, CCC 2003, pp. 239–247.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献