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.
Overview
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
-
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity
-
More Barriers for Rank Methods, via a "Numeric to Symbolic" Transfer
-
Agreement Testing Theorems on Layered Set Systems
-
Hypergraph K-Cut for Fixed K in Deterministic Polynomial Time
-
Derandomization from Algebraic Hardness - Treading the Borders
-
A Dichotomy for Real Boolean Holant Problems
