Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Robustness of Average-Case Meta-Complexity via Pseudorandomness

Robustness of Average-Case Meta-Complexity via Pseudorandomness

Thumbnail Image
Download
Name

3519935.3520051.pdf

Size

218.48 KB

Format

Adobe PDF

Checksum (MD5)

22f5e3e0b6bea4e736a7b41515432720

Download all files submitted through automated deposit
3519935.3520051.zip (173.86 KB)
Author(s)
Ilango, Rahul
•
Ren, Hanlin
•
Santhanam, Rahul
Date Issued
June 9, 2022
Publisher
ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
Citation
Ilango, Rahul, Ren, Hanlin and Santhanam, Rahul. 2022. "Robustness of Average-Case Meta-Complexity via Pseudorandomness."
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/
Persistent DSpace Link
https://hdl.handle.net/1721.1/146440
DOI of Published Version
https://doi.org/10.1145/3519935.3520051
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.