skip to content

Department of Computer Science and Technology

Speaker

Albert Atserias, Universitat Politècnica de Catalunya


Title

Complexity of Proof Search


Abstract

I will survey the area of the algorithmic complexity of proof search for propositional logic, also known as automatability.


Slides

Complexity of Proof Search