| dc.contributor.author | Williams, R Ryan | |
| dc.date.accessioned | 2021-10-27T20:34:54Z | |
| dc.date.available | 2021-10-27T20:34:54Z | |
| dc.date.issued | 2018 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/136331 | |
| dc.language.iso | en | |
| dc.publisher | Society for Industrial & Applied Mathematics (SIAM) | |
| dc.relation.isversionof | 10.1137/15M1024524 | |
| 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. | |
| dc.source | SIAM | |
| dc.title | Faster All-Pairs Shortest Paths via Circuit Complexity | |
| dc.type | Article | |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
| dc.relation.journal | SIAM Journal on Computing | |
| dc.eprint.version | Final published version | |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | |
| dc.date.updated | 2021-03-30T13:52:21Z | |
| dspace.orderedauthors | Williams, RR | |
| dspace.date.submission | 2021-03-30T13:52:22Z | |
| mit.journal.volume | 47 | |
| mit.journal.issue | 5 | |
| mit.license | PUBLISHER_POLICY | |
| mit.metadata.status | Authority Work and Publication Information Needed | |
