Strong Average-Case Lower Bounds from Non-trivial Derandomization

dc.contributor.author	Chen, Lijie
dc.contributor.author	Ren, Hanlin
dc.date.accessioned	2022-11-08T16:44:42Z
dc.date.available	2022-11-08T16:44:42Z
dc.date.issued	2020-06-08
dc.identifier.isbn	978-1-4503-6979-4
dc.identifier.uri	https://hdl.handle.net/1721.1/146215
dc.publisher	ACM\|Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing	en_US
dc.relation.isversionof	https://doi.org/10.1145/3357713.3384279	en_US
dc.rights	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.	en_US
dc.source	ACM\|Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing	en_US
dc.title	Strong Average-Case Lower Bounds from Non-trivial Derandomization	en_US
dc.type	Article	en_US
dc.identifier.citation	Chen, Lijie and Ren, Hanlin. 2020. "Strong Average-Case Lower Bounds from Non-trivial Derandomization."
dc.contributor.department	Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
dc.identifier.mitlicense	PUBLISHER_POLICY
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-02T20:45:31Z
dc.language.rfc3066	en
dc.rights.holder	ACM
dspace.date.submission	2022-11-02T20:45:31Z
mit.license	PUBLISHER_POLICY
mit.metadata.status	Authority Work and Publication Information Needed	en_US