Simple and Fast Derandomization from Very Hard Functions: Eliminating Randomness at Almost No Cost
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
ACM|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
2022
|
Online Access: | https://hdl.handle.net/1721.1/145922 |
_version_ | 1826188642005024768 |
---|---|
author | Chen, Lijie Tell, Roei |
author2 | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
author_facet | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Chen, Lijie Tell, Roei |
author_sort | Chen, Lijie |
collection | MIT |
first_indexed | 2024-09-23T08:02:31Z |
format | Article |
id | mit-1721.1/145922 |
institution | Massachusetts Institute of Technology |
language | English |
last_indexed | 2024-09-23T08:02:31Z |
publishDate | 2022 |
publisher | ACM|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing |
record_format | dspace |
spelling | mit-1721.1/1459222023-02-15T21:35:22Z Simple and Fast Derandomization from Very Hard Functions: Eliminating Randomness at Almost No Cost Chen, Lijie Tell, Roei Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory 2022-10-21T15:35:08Z 2022-10-21T15:35:08Z 2021-06-15 2022-10-20T14:20:19Z Article http://purl.org/eprint/type/ConferencePaper 978-1-4503-8053-9 https://hdl.handle.net/1721.1/145922 Chen, Lijie and Tell, Roei. 2021. "Simple and Fast Derandomization from Very Hard Functions: Eliminating Randomness at Almost No Cost." PUBLISHER_CC en https://doi.org/10.1145/3406325.3451059 Creative Commons Attribution-NoDerivs License https://creativecommons.org/licenses/by-nd/4.0/ The author(s) application/pdf ACM|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing ACM|Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing |
spellingShingle | Chen, Lijie Tell, Roei Simple and Fast Derandomization from Very Hard Functions: Eliminating Randomness at Almost No Cost |
title | Simple and Fast Derandomization from Very Hard Functions: Eliminating Randomness at Almost No Cost |
title_full | Simple and Fast Derandomization from Very Hard Functions: Eliminating Randomness at Almost No Cost |
title_fullStr | Simple and Fast Derandomization from Very Hard Functions: Eliminating Randomness at Almost No Cost |
title_full_unstemmed | Simple and Fast Derandomization from Very Hard Functions: Eliminating Randomness at Almost No Cost |
title_short | Simple and Fast Derandomization from Very Hard Functions: Eliminating Randomness at Almost No Cost |
title_sort | simple and fast derandomization from very hard functions eliminating randomness at almost no cost |
url | https://hdl.handle.net/1721.1/145922 |
work_keys_str_mv | AT chenlijie simpleandfastderandomizationfromveryhardfunctionseliminatingrandomnessatalmostnocost AT tellroei simpleandfastderandomizationfromveryhardfunctionseliminatingrandomnessatalmostnocost |