Some Adventures in Combinatorial Computing: small data and extreme computingAlgebra & Discrete Mathematics
|Jon Lee, University of Michigan
|Thu, May 21 2015, 4:10PM
I will describe some of my adventures in using mathematics to push the limits of computing for some combinatorial problems: matroid optimization, Euclidean Steiner problems, and enumerating points in polytopes. Spanning a range of six orders of magnitude in cost, probably you have never done scientific computing on hardware that is more powerful nor less powerful than some that I will describe.