1. Resolution is not automatizable unless W[P] is tractable;Alekhnovich,2001
2. On the automatizability of resolution and related propositional proof systems;Atserias;Information and Computation,2004
3. Lower bounds for the weak pigeonhole principle and random formulas beyond resolution;Atserias;Information and Computation,2002
4. A. Atserias, E. Maneva, Mean payoff-games and the max-atom problem, Technical Report, 2009. Available from: http://www.lsi.upc.edu/∼atserias.
5. Simplified and improved resolution lower bounds;Beame,1996