What is smoothed analysis? Daniel Spielman won the Rolf Nevanlinna Prize in 2010 “for smoothed analysis of Linear Programming, algorithms for graph-based codes and applications of graph theory to Numerical Computing.” In our interview I asked him to explain … 23. Sep 2014 | By John D. Cook | 1 comment
