Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Faster All-Pairs Shortest Paths via Circuit Complexity

Faster All-Pairs Shortest Paths via Circuit Complexity

Thumbnail Image
Download
Name

15m1024524.pdf

Description
Published version
Size

453.01 KB

Format

Adobe PDF

Checksum (MD5)

3c787df733e3cc191b00b16efc21abee

sword-2021-03-30T13:52:21.original.xml (130 B)
Original SWORD entry document
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
https://hdl.handle.net/1721.1/136331
DOI of Published Version
https://doi.org/10.1137/15M1024524
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.