Pseudorandomness and the Minimum Circuit Size problem
Main Author: | Santhanam, R |
---|---|
Format: | Conference item |
Language: | English |
Published: |
Schloss Dahgstuhl
2020
|
Similar Items
-
NP-hardness of minimum circuit size problem for OR-AND-MOD circuits
by: Hirahara, S, et al.
Published: (2018) -
Conspiracies between learning algorithms, circuit lower bounds and pseudorandomness
by: Oliveira, I, et al.
Published: (2017) -
Robustness of Average-Case Meta-Complexity via Pseudorandomness
by: Ilango, Rahul, et al.
Published: (2022) -
Algebraic methods in pseudorandomness and circuit complexity
by: Remscrim, Zachary (Zachary N.)
Published: (2016) -
The Minimum Oracle Circuit Size Problem
by: Allender, Eric, et al.
Published: (2017)