Why Are Proof Complexity Lower Bounds Hard?
Offered By: IEEE via YouTube
Course Description
Overview
Explore the challenges of proving lower bounds in proof complexity through this 23-minute IEEE conference talk by Jan Pich and Rahul Santhanam. Delve into the fundamentals of proof complexity, its applications, and current knowledge about proof compression. Examine hard candidates and conditional results before diving into formalization techniques, including standard and more precise statements. Gain insights into the proofs, perspectives, and barriers in this field. Conclude with thought-provoking questions that highlight the complexities and open problems in proof complexity research.
Syllabus
Introduction
What is Proof Complexity
What is Proof Complexity good for
What is known about Proof Compression
Hard Candidates
Conditional Results
Rootage
Formalization
Standard Formalization
More Precise Statements
Proofs
Perspective
Barriers
Questions
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against NatureIEEE via YouTube Computation in the Brain Tutorial - Part 2
IEEE via YouTube Computation in the Brain - Part 1
IEEE via YouTube Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube