Simple and fast derandomization from very hard functions: eliminating randomness at almost no cost

DOI10.1145/3406325.3451059OpenAlexW3168841113MaRDI QIDQ6087001

Roei Tell, Lijie Chen

Publication date: 14 November 2023

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

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

zbMATH Keywords

derandomizationcircuit lower boundshardness versus randomness

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

Paradigms for Unconditional Pseudorandom Generators ⋮ On hitting-set generators for polynomials that vanish rarely