Playlist: 28 videos

Boolean Devices

0:29:27

Monotone Circuit Lower Bounds from Resolution (Now with Applications!)

Mika Göös (Harvard University)
https://simons.berkeley.edu/talks/tbd-17
Boolean Devices
Visit talk page
0:34:33

Locating Linear Decision Lists within TC^0

Meena Mahajan (Institute of Mathematical Sciences)
https://simons.berkeley.edu/talks/tbd-18
Boolean Devices
Visit talk page
0:36:36

An Overview of Quantified Derandomization

Roei Tell (Weizmann Institute)
https://simons.berkeley.edu/talks/overview-quantified-derandomization
Boolean Devices
Visit talk page
0:46:12

Clique Is Hard on Average for Regular Resolution

Susanna de Rezende (KTH Royal Institute of Technology)
https://simons.berkeley.edu/talks/clique-hard-average-regular-resolution
Boolean Devices
Visit talk page
0:45:39

Fooling Polytopes

Li-Yang Tan (Stanford University)
https://simons.berkeley.edu/talks/fooling-polytopes
Boolean Devices
Visit talk page
1:7:45

A Survey on MCSP

Rahul Santhanam (University of Oxford)
https://simons.berkeley.edu/talks/tbd-19
Boolean Devices
Visit talk page
0:34:52

Hardness Magnification

Igor Carboni Oliveira (University of Oxford)
https://simons.berkeley.edu/talks/theory-hardness-magnification
Boolean Devices
Visit talk page
0:35:40

Natural Properties, MCSP, and Proving Circuit Lower Bounds

Valentine Kabanets (Simon Fraser University)
https://simons.berkeley.edu/talks/minimum-circuit-size-problem-recent-results-and-future-directions
Boolean Devices
Visit talk page
0:32:56

A Review of Some Recent Lower Bounds Against Low-Depth Threshold Circuits

Ryan Williams (MIT)
https://simons.berkeley.edu/talks/tbd-20
Boolean Devices
Visit talk page
0:27:48

Recent Structure Lemmas for Depth-two Threshold Circuits

Lijie Chen (MIT)
https://simons.berkeley.edu/talks/recent-structure-lemmas-depth-two-threshold-circuits
Boolean Devices
Visit talk page