Strong average-case lower bounds from non-trivial derandomization

DOI10.1145/3357713.3384279OpenAlexW3035226643MaRDI QIDQ5145016

Hanlin Ren, Lijie Chen

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3357713.3384279

zbMATH Keywords

circuit complexityderandomizationaverage-case complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (4)

MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications ⋮ Quantified Derandomization: How to Find Water in the Ocean ⋮ Lower bounds against sparse symmetric functions of ACC circuits: expanding the reach of \#SAT algorithms ⋮ Average-case rigidity lower bounds

This page was built for publication: Strong average-case lower bounds from non-trivial derandomization