On the automatizability of Polynomial Calculus
Parameterized Complexity of DPLL Search Procedures
Paris-Harrington tautologies
Optimality of size-degree trade-offs for Polynomial Calculus
