On the complexity of resolution-based proof systems 

Oliva Valls, Sergi (Date of defense: 2013-05-02)

Propositional Proof Complexity is the area of Computational Complexity that studies the length of proofs in propositional logic. One of its main questions is to determine which particular propositional formulas have short ...