Complexity Lower Bounds from Algorithm Design

Author(s)
Williams, R Ryan
Thumbnail
DownloadAccepted version (158.8Kb)
Open Access Policy
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Date issued
2021
URI
https://hdl.handle.net/1721.1/143933
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Journal
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Williams, R Ryan. 2021. "Complexity Lower Bounds from Algorithm Design." 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).
Version: Author's final manuscript
Collections