F. Grandoni paper cited in the MIT course "Algorithmic Lower Bounds: Fun with Hardness Proofs"
13 January 2015
During his 2014 graduate class at MIT on "Algorithmic Lower Bounds: Fun with Hardness Proofs", Prof. Erik Demaine describes some very recent results of Fabrizio Grandoni and his coauthors Amir Abboud and Virginia Vassilevska Williams, both from Stanford University (published in the ACM-SIAM Symposium on Discrete Algorithms, 2015).