YoVDO

Composition Theorems via Lifting

Offered By: IEEE via YouTube

Tags

IEEE FOCS: Foundations of Computer Science Courses Mathematical logic Courses Theoretical Computer Science Courses Boolean Circuits Courses

Course Description

Overview

Explore the Karchmer-Razborov-Wigderson (KRW) composition theorems in this 22-minute IEEE conference talk. Delve into Boolean circuits, the KRW approach, and the KRW conjecture. Learn about the Karchmer-Wigderson Theorem and the current state of the art in the field. Examine the monotone KRW conjecture and the presenters' monotone result. Investigate semi-monotone composition and the speakers' findings in this area. Gain insights from experts Susanna F. de Rezende, Or Meir, Jakob Nordstrvm, Toniann Pitassi, and Robert Robere as they discuss their research and contributions to the field of computational complexity theory.

Syllabus

Intro
Boolean circuits
The KRW approach
The KRW conjecture
Our results (very informal)
Karchmer-Wigderson Theorem
State of the art
Monotone KRW conjecture
Our monotone result
Semi-monotone composition
Our semi-monotone result


Taught by

IEEE FOCS: Foundations of Computer Science

Tags

Related Courses

Algebra & Algorithms
Moscow Institute of Physics and Technology via Coursera
Lower Bounds in Complexity Theory, Communication Complexity, and Sunflowers - Toniann Pitassi
Institute for Advanced Study via YouTube
Proof and Circuit Complexity - Robert Robere
Institute for Advanced Study via YouTube
Undergrad Complexity at CMU - SAT
Ryan O'Donnell via YouTube
Improved Non-Interactive Zero Knowledge with Applications to Post-Quantum Signatures
Association for Computing Machinery (ACM) via YouTube