1. Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas;Alekhnovich;J. Automat. Reason.,2005
2. Lower bounds for polynomial calculus: non-binomial case;Alekhnovich,2001
3. Space complexity in propositional Calculus;Alekhnovich;SIAM J. Comput.,2002
4. Constraint propagation as a proof system;Atserias,2004
5. Towards understanding and harnessing the potential of clause learning;Beame;J. Artif. Intell. Res. (JAIR),2004