Robustness of Average-Case Meta-Complexity via Pseudorandomness

Bibliographic Details
Main Authors: Ilango, Rahul, Ren, Hanlin, Santhanam, Rahul
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:English
Published: ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing 2022
Online Access:https://hdl.handle.net/1721.1/146440
_version_ 1826192290438184960
author Ilango, Rahul
Ren, Hanlin
Santhanam, Rahul
author2 Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
author_facet Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Ilango, Rahul
Ren, Hanlin
Santhanam, Rahul
author_sort Ilango, Rahul
collection MIT
first_indexed 2024-09-23T09:09:13Z
format Article
id mit-1721.1/146440
institution Massachusetts Institute of Technology
language English
last_indexed 2024-09-23T09:09:13Z
publishDate 2022
publisher ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
record_format dspace
spelling mit-1721.1/1464402023-02-16T16:40:56Z Robustness of Average-Case Meta-Complexity via Pseudorandomness Ilango, Rahul Ren, Hanlin Santhanam, Rahul Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory 2022-11-15T15:14:40Z 2022-11-15T15:14:40Z 2022-06-09 2022-11-03T12:16:49Z Article http://purl.org/eprint/type/ConferencePaper 978-1-4503-9264-8 https://hdl.handle.net/1721.1/146440 Ilango, Rahul, Ren, Hanlin and Santhanam, Rahul. 2022. "Robustness of Average-Case Meta-Complexity via Pseudorandomness." PUBLISHER_CC en https://doi.org/10.1145/3519935.3520051 Creative Commons Attribution 4.0 International license https://creativecommons.org/licenses/by/4.0/ The author(s) application/pdf ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing ACM|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
spellingShingle Ilango, Rahul
Ren, Hanlin
Santhanam, Rahul
Robustness of Average-Case Meta-Complexity via Pseudorandomness
title Robustness of Average-Case Meta-Complexity via Pseudorandomness
title_full Robustness of Average-Case Meta-Complexity via Pseudorandomness
title_fullStr Robustness of Average-Case Meta-Complexity via Pseudorandomness
title_full_unstemmed Robustness of Average-Case Meta-Complexity via Pseudorandomness
title_short Robustness of Average-Case Meta-Complexity via Pseudorandomness
title_sort robustness of average case meta complexity via pseudorandomness
url https://hdl.handle.net/1721.1/146440
work_keys_str_mv AT ilangorahul robustnessofaveragecasemetacomplexityviapseudorandomness
AT renhanlin robustnessofaveragecasemetacomplexityviapseudorandomness
AT santhanamrahul robustnessofaveragecasemetacomplexityviapseudorandomness