Faster All-Pairs Shortest Paths via Circuit Complexity
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Society for Industrial & Applied Mathematics (SIAM)
2021
|
| Online Access: | https://hdl.handle.net/1721.1/136331 |
| _version_ | 1826188044801146880 |
|---|---|
| author | Williams, R Ryan |
| author2 | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
| author_facet | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Williams, R Ryan |
| author_sort | Williams, R Ryan |
| collection | MIT |
| first_indexed | 2024-09-23T07:53:45Z |
| format | Article |
| id | mit-1721.1/136331 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T07:53:45Z |
| publishDate | 2021 |
| publisher | Society for Industrial & Applied Mathematics (SIAM) |
| record_format | dspace |
| spelling | mit-1721.1/1363312023-09-01T19:32:43Z Faster All-Pairs Shortest Paths via Circuit Complexity Williams, R Ryan Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2021-10-27T20:34:54Z 2021-10-27T20:34:54Z 2018 2021-03-30T13:52:21Z Article http://purl.org/eprint/type/JournalArticle https://hdl.handle.net/1721.1/136331 en 10.1137/15M1024524 SIAM Journal on Computing 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. application/pdf Society for Industrial & Applied Mathematics (SIAM) SIAM |
| spellingShingle | Williams, R Ryan Faster All-Pairs Shortest Paths via Circuit Complexity |
| title | Faster All-Pairs Shortest Paths via Circuit Complexity |
| title_full | Faster All-Pairs Shortest Paths via Circuit Complexity |
| title_fullStr | Faster All-Pairs Shortest Paths via Circuit Complexity |
| title_full_unstemmed | Faster All-Pairs Shortest Paths via Circuit Complexity |
| title_short | Faster All-Pairs Shortest Paths via Circuit Complexity |
| title_sort | faster all pairs shortest paths via circuit complexity |
| url | https://hdl.handle.net/1721.1/136331 |
| work_keys_str_mv | AT williamsrryan fasterallpairsshortestpathsviacircuitcomplexity |