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

From Circuit Complexity to Faster All-Pairs Shortest Paths

Thumbnail Image
Download
Name

21m1418654.pdf

Description
Published version
Size

469.79 KB

Format

Adobe PDF

Checksum (MD5)

39260ce69d21f200e82d44cdaece7536

sword-2022-07-21T16:01:15.original.xml (130 B)
Original SWORD entry document
Author(s)
Williams, R Ryan
Date Issued
2021
Journal
SIAM Review
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Citation
Williams, R Ryan. 2021. "From Circuit Complexity to Faster All-Pairs Shortest Paths." SIAM Review, 63 (3).
Version
Final published version
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
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/143934
DOI of Published Version
https://doi.org/10.1137/21M1418654
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.