Propositional Proof Complexity

author: Alexander Razborov, University of Chicago
published: July 6, 2021,   recorded: July 2021,   views: 0

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


Propositional proof complexity studies efficient provability of statements that can be expressed in quantifier-free form, in various proof systems and under various notions of “efficiency”. Statements of interest come from a variety of sources that, besides traditional combinatorial principles and other mathematical theorems, include areas like combinatorial optimization, practical SAT solving and operation research. While many proof systems considered in the modern proof complexity are still traditional, in the sense that they are Hilbert-style and logic-based, a considerable amount of attention has been in recent years paid to systems modelling algebraic and semi-algebraic reasoning, including elementary convex geometry. In this talk I will attempt to convey some basic ideas underlying this vibrant area, including a necessarily based sample of illustrating examples.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: