| RUS ENG |
| Full version |
|
|
|
| VIDEO LIBRARY |
|
Logical Perspectives 2025: Open Lectures
|
|||
|
|
|||
|
Propositional Proof Complexity A. A. Razborovab a University of Chicago b Steklov Mathematical Institute of Russian Academy of Sciences, Moscow |
|||
|
Abstract: Propositional proof complexity studies efficient provability of quantifier-free statements in various proof systems and under various notions of efficiency. In this talk I will attempt to convey some of its basic concepts, ideas and results, including numerous connections to other areas in logic, theoretical computer science and beyond. Language: English |
|||