Faster All-Pairs Shortest Paths via Circuit Complexity
Name
15m1024524.pdf
Description
Published version
Size
453.01 KB
Format
Adobe PDF
Checksum (MD5)
3c787df733e3cc191b00b16efc21abee
Author(s)
Williams, R Ryan
Date Issued
2018
Journal
SIAM Journal on Computing
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1137/15M1024524