Strong Average-Case Lower Bounds from Non-trivial Derandomization
Main Authors: | Chen, Lijie, Ren, Hanlin |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
ACM|Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
2022
|
Online Access: | https://hdl.handle.net/1721.1/146215 |
Similar Items
-
Inverse-Exponential Correlation Bounds and Extremely Rigid Matrices from a New Derandomized XOR Lemma
by: Chen, Lijie, et al.
Published: (2022) -
Derandomization of auctions
by: Aggarwal, Gagan, et al.
Published: (2015) -
Simple and Fast Derandomization from Very Hard Functions: Eliminating Randomness at Almost No Cost
by: Chen, Lijie, et al.
Published: (2022) -
Derandomization Security of Homomorphic Encryption
by: A. . Trepacheva
Published: (2018-10-01) -
Pseudo-derandomizing learning and approximation
by: Oliveira, I, et al.
Published: (2018)