STOC 2020

Session 10B - Strong Average-Case Circuit Lower Bounds from Non-trivial Derandomization

Sep 19, 2020

|

27 views

Association for Computing Machinery (ACM)

Details

A full version of the talk (given by Lijie) can be found at https://www.youtube.com/watch?v=85XS9H_U4q0.

Category: STOC 2020

Comments

loading...

Reactions (0) | Note

📝 No reactions yet

Be the first one to share your thoughts!

Reactions(0)

Note

loading...

Recommended

ICAPS 2014: Miquel Ramírez on "Directed Fixed-Point Regression-Based Planning..."

ICAPS | Sep 22, 2014

Representation Learning: A Review and New Perspectives

AISTATS 2014 | Nov 12, 2014

Playing Atari with Deep Reinforcement Learning | Two Minute Paper

Two Minute Papers | Mar 7, 2015

ICAPS 2014: Menkes van den Briel on "Flow-based Heuristics for Optimal Planning"

ICAPS | Mar 13, 2015

ICAPS 2014: Jendrik Seipp on "Diverse and Additive Cartesian Abstraction Heuristics"

ICAPS | Apr 14, 2015