Circuits Of Bounded Depth

Klim Efremenko, Tel Aviv University Algebraic Geometry Boot Camp http://simons.berkeley.edu/talks/klim-efremenko-2014-09-02.

Technion Theoretical Computer Science Seminar - 28 October 2020.

Title: Weak Lower Bounds on Resource-

The beautiful work of Applebaum, Ishai, and Kushileviz [FOCS'11] initiated the study of arithmetic variants of Yao's garbled

Okay so essentially these are these classes consist of Boolean functions which can be computed by

Ryan Williams (MIT) https://simons.berkeley.edu/talks/tbd-20 Boolean Devices.

12th Innovations in Theoretical Computer Science Conference (ITCS 2021) http://itcs-conf.org/

So ACC is basically constant

First talk of the GCT2022 conference. More information and material: https://gct2022.sciencesconf.org.

Ji Luo (Boston University) https://simons.berkeley.edu/talks/ji-luo-boston-university-2025-06-26 Obfuscation Although we have ...

Order log to the power i n

"Functional lower bounds for restricted arithmetic

Mrinal Kumar (Harvard University) https://simons.berkeley.edu/talks/improved-

Basic definitions in

I will present two families of mathematical problems that are very simple to describe, that seem natural to study from geometric, ...

Justin Thaler, Harvard University Neo-Classical Methods in Discrete Analysis ...

Rachel Lin (University of Washington) https://simons.berkeley.edu/talks/rachel-lin-university-washington-2023-05-04 Minimal ...

Bounded depth circuit

Joint work with Sebastian Faust, Tal Rabin, Eran Tromer, and Vinod Vaikuntanathan Computational devices leak side-channel ...