Complexity Lower Bounds from Algorithm Design
Name
LICS21.pdf
Description
Accepted version
Size
158.82 KB
Format
Adobe PDF
Checksum (MD5)
93ac45b78a051fc4666d69bf7565bc1e
Author(s)
Williams, R Ryan
Date Issued
2021
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
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/LICS52264.2021.9470522
