Simple and Fast Derandomization from Very Hard Functions: Eliminating Randomness at Almost No Cost

dc.contributor.author	Chen, Lijie
dc.contributor.author	Tell, Roei
dc.date.accessioned	2022-10-21T15:35:08Z
dc.date.available	2022-10-21T15:35:08Z
dc.date.issued	2021-06-15
dc.identifier.isbn	978-1-4503-8053-9
dc.identifier.uri	https://hdl.handle.net/1721.1/145922
dc.publisher	ACM\|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing	en_US
dc.relation.isversionof	https://doi.org/10.1145/3406325.3451059	en_US
dc.rights	Creative Commons Attribution-NoDerivs License	en_US
dc.rights.uri	https://creativecommons.org/licenses/by-nd/4.0/	en_US
dc.source	ACM\|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing	en_US
dc.title	Simple and Fast Derandomization from Very Hard Functions: Eliminating Randomness at Almost No Cost	en_US
dc.type	Article	en_US
dc.identifier.citation	Chen, Lijie and Tell, Roei. 2021. "Simple and Fast Derandomization from Very Hard Functions: Eliminating Randomness at Almost No Cost."
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-10-20T14:20:19Z
dc.language.rfc3066	en
dc.rights.holder	The author(s)
dspace.date.submission	2022-10-20T14:20:19Z
mit.license	PUBLISHER_CC
mit.metadata.status	Authority Work and Publication Information Needed	en_US