ACM Symposium on Theory of Computing, STOC 2014


Article Details
Title: Faster all-pairs shortest paths via circuit complexity
Article URLs:
Alternative Article URLs:
Authors: Ryan Williams
  • Stanford University
Sharing: Unknown
Verification: Author has not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1212372
DBLP Key: conf/stoc/Williams14a
Author Comments:

Discuss this paper and its artifacts below