| dc.contributor.author | Williams, R Ryan | |
| dc.date.accessioned | 2022-07-21T16:04:20Z | |
| dc.date.available | 2022-07-21T16:04:20Z | |
| dc.date.issued | 2021 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/143933 | |
| dc.language.iso | en | |
| dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | en_US |
| dc.relation.isversionof | 10.1109/LICS52264.2021.9470522 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | MIT web domain | en_US |
| dc.title | Complexity Lower Bounds from Algorithm Design | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Williams, R Ryan. 2021. "Complexity Lower Bounds from Algorithm Design." 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). | |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | |
| dc.relation.journal | 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | en_US |
| dc.eprint.version | Author's final manuscript | 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-07-21T15:55:46Z | |
| dspace.orderedauthors | Williams, RR | en_US |
| dspace.date.submission | 2022-07-21T15:55:47Z | |
| mit.license | OPEN_ACCESS_POLICY | |
| mit.metadata.status | Authority Work and Publication Information Needed | en_US |
