A polynomial restriction lemma with applications
From MaRDI portal
Publication:4978008
DOI10.1145/3055399.3055470zbMath1370.68223OpenAlexW2624881990MaRDI QIDQ4978008
Zhenjian Lu, Daniel M. Kane, Valentine Kabanets
Publication date: 17 August 2017
Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3055399.3055470
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization ⋮ Unnamed Item ⋮ Cryptographic hardness under projections for time-bounded Kolmogorov complexity ⋮ Unnamed Item ⋮ The Littlewood-Offord problem for Markov chains ⋮ A \#SAT algorithm for small constant-depth circuits with PTF gates
This page was built for publication: A polynomial restriction lemma with applications
