Now showing items 1-1 of 1
Propositional proof systems : efficiency and automatizability
(Massachusetts Institute of Technology, 2003)
The thesis considers two fundamental questions in propositional proof complexity: lower bounds on the size of the shortest proof and automatizability of propositional proof systems. With respect to the first part, we develop ...