Author:
Dantchev Stefan,Martin Barnaby
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Atserias, A., Bonet, M.: On the automatizability of resolution and related propositional proof systems. In: 16th Annual Conference of the European Association for Computer Science Logic (2002)
2. Atserias, A., Bonet, M.L., Esteban, J.L.: Lower bounds for the weak pigeonhole principle and random formulas beyond resolution. Inf. Comput. 176(2), 136–152 (2002)
3. Beyersdorff, O., Galesi, N., Lauria, M.: Hardness of parameterized resolution. Technical report, ECCC (2010)
4. Lecture Notes in Computer Science;O. Beyersdorff,2011
5. Lecture Notes in Computer Science;O. Beyersdorff,2011