Strong Average-Case Lower Bounds from Non-trivial Derandomization

Bibliographic Details
Main Authors: Chen, Lijie, Ren, Hanlin
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:English
Published: ACM|Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing 2022
Online Access:https://hdl.handle.net/1721.1/146215
_version_ 1811088217635553280
author Chen, Lijie
Ren, Hanlin
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
Ren, Hanlin
author_sort Chen, Lijie
collection MIT
first_indexed 2024-09-23T13:58:34Z
format Article
id mit-1721.1/146215
institution Massachusetts Institute of Technology
language English
last_indexed 2024-09-23T13:58:34Z
publishDate 2022
publisher ACM|Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
record_format dspace
spelling mit-1721.1/1462152023-02-16T15:44:31Z Strong Average-Case Lower Bounds from Non-trivial Derandomization Chen, Lijie Ren, Hanlin Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory 2022-11-08T16:44:42Z 2022-11-08T16:44:42Z 2020-06-08 2022-11-02T20:45:31Z Article http://purl.org/eprint/type/ConferencePaper 978-1-4503-6979-4 https://hdl.handle.net/1721.1/146215 Chen, Lijie and Ren, Hanlin. 2020. "Strong Average-Case Lower Bounds from Non-trivial Derandomization." PUBLISHER_POLICY en https://doi.org/10.1145/3357713.3384279 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. ACM application/pdf ACM|Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing ACM|Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
spellingShingle Chen, Lijie
Ren, Hanlin
Strong Average-Case Lower Bounds from Non-trivial Derandomization
title Strong Average-Case Lower Bounds from Non-trivial Derandomization
title_full Strong Average-Case Lower Bounds from Non-trivial Derandomization
title_fullStr Strong Average-Case Lower Bounds from Non-trivial Derandomization
title_full_unstemmed Strong Average-Case Lower Bounds from Non-trivial Derandomization
title_short Strong Average-Case Lower Bounds from Non-trivial Derandomization
title_sort strong average case lower bounds from non trivial derandomization
url https://hdl.handle.net/1721.1/146215
work_keys_str_mv AT chenlijie strongaveragecaselowerboundsfromnontrivialderandomization
AT renhanlin strongaveragecaselowerboundsfromnontrivialderandomization