Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Simple and Fast Derandomization from Very Hard Functions: Eliminating Randomness at Almost No Cost

Simple and Fast Derandomization from Very Hard Functions: Eliminating Randomness at Almost No Cost

Thumbnail Image
Download
Name

3406325.3451059.pdf

Size

794.33 KB

Format

Adobe PDF

Checksum (MD5)

1a8b3f589b02c4d65394abb58897b722

Download all files submitted through automated deposit
3406325.3451059.zip (718.25 KB)
Author(s)
Chen, Lijie
•
Tell, Roei
Date Issued
June 15, 2021
Publisher
ACM|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
Citation
Chen, Lijie and Tell, Roei. 2021. "Simple and Fast Derandomization from Very Hard Functions: Eliminating Randomness at Almost No Cost."
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-NoDerivs License
https://creativecommons.org/licenses/by-nd/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/145922
DOI of Published Version
https://doi.org/10.1145/3406325.3451059
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.