Friday 4/05 Colloquium – Tim Randolph ’18
Friday, April 05 2:35pm in Wege (TCL 123) Algorithmic Approaches to Subset Sum (and Other Hard Problems) The Subset Sum problem is the most fundamental NP-complete problem concerned with adding numbers together. However, progress on exact algorithms for this problem has been slow: Since Horowitz and Sahni’s… Continue reading »