Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Strong Average-Case Lower Bounds from Non-trivial Derandomization

Strong Average-Case Lower Bounds from Non-trivial Derandomization

Thumbnail Image
Download
Name

3357713.3384279.pdf

Size

872.77 KB

Format

Adobe PDF

Checksum (MD5)

9c4749b4f0ed6f7eb71a4dec9897456d

Download all files submitted through automated deposit
3357713.3384279.zip (806.31 KB)
Author(s)
Chen, Lijie
•
Ren, Hanlin
Date Issued
June 8, 2020
Publisher
ACM|Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
Citation
Chen, Lijie and Ren, Hanlin. 2020. "Strong Average-Case Lower Bounds from Non-trivial Derandomization."
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
https://hdl.handle.net/1721.1/146215
DOI of Published Version
https://doi.org/10.1145/3357713.3384279
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.