| dc.contributor.author | Williams, R Ryan | |
| dc.date.accessioned | 2022-07-21T16:11:43Z | |
| dc.date.available | 2022-07-21T16:11:43Z | |
| dc.date.issued | 2021 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/143934 | |
| dc.language.iso | en | |
| dc.publisher | Society for Industrial & Applied Mathematics (SIAM) | en_US |
| dc.relation.isversionof | 10.1137/21M1418654 | en_US |
| dc.rights | 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. | en_US |
| dc.source | SIAM | en_US |
| dc.title | From Circuit Complexity to Faster All-Pairs Shortest Paths | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Williams, R Ryan. 2021. "From Circuit Complexity to Faster All-Pairs Shortest Paths." SIAM Review, 63 (3). | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | |
| dc.relation.journal | SIAM Review | en_US |
| dc.eprint.version | Final published version | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dc.date.updated | 2022-07-21T16:01:15Z | |
| dspace.orderedauthors | Williams, RR | en_US |
| dspace.date.submission | 2022-07-21T16:01:16Z | |
| mit.journal.volume | 63 | en_US |
| mit.journal.issue | 3 | en_US |
| mit.license | PUBLISHER_POLICY | |
| mit.metadata.status | Authority Work and Publication Information Needed | en_US |
