Robustness of Average-Case Meta-Complexity via Pseudorandomness

dc.contributor.author	Ilango, Rahul
dc.contributor.author	Ren, Hanlin
dc.contributor.author	Santhanam, Rahul
dc.date.accessioned	2022-11-15T15:14:40Z
dc.date.available	2022-11-15T15:14:40Z
dc.date.issued	2022-06-09
dc.identifier.isbn	978-1-4503-9264-8
dc.identifier.uri	https://hdl.handle.net/1721.1/146440
dc.publisher	ACM\|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing	en_US
dc.relation.isversionof	https://doi.org/10.1145/3519935.3520051	en_US
dc.rights	Creative Commons Attribution 4.0 International license	en_US
dc.rights.uri	https://creativecommons.org/licenses/by/4.0/	en_US
dc.source	ACM\|Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing	en_US
dc.title	Robustness of Average-Case Meta-Complexity via Pseudorandomness	en_US
dc.type	Article	en_US
dc.identifier.citation	Ilango, Rahul, Ren, Hanlin and Santhanam, Rahul. 2022. "Robustness of Average-Case Meta-Complexity via Pseudorandomness."
dc.contributor.department	Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
dc.identifier.mitlicense	PUBLISHER_CC
dc.eprint.version	Final published version	en_US
dc.type.uri	http://purl.org/eprint/type/ConferencePaper	en_US
eprint.status	http://purl.org/eprint/status/NonPeerReviewed	en_US
dc.date.updated	2022-11-03T12:16:49Z
dc.language.rfc3066	en
dc.rights.holder	The author(s)
dspace.date.submission	2022-11-03T12:16:49Z
mit.license	PUBLISHER_CC
mit.metadata.status	Authority Work and Publication Information Needed	en_US