Hardness Of Shortest Path Intro To Theoretical Computer Science
Huck Bennett (Oregon State University) ... Vijaya Ramachandran, University of Texas, Austin Computational Complexity of Low-Polynomial Time Problems ... From Scalars to Vectors: Approximability and Virginia Vassilevska Williams, Stanford University Fine-Grained Complexity and Algorithm Design Boot Camp ... Ce Jin (MIT), Yinzhan Xu (MIT) Data Structures and Optimization for Fast ...
