Speaker: Abraham Flaxman

Time: Wednesday 12-1pm

Place: NSH 1507

Title: Average-case analysis for combinatorial search and the subset sum problem

Abstract:
I will give a survey of some recent developments in average-case
analysis of algorithms for combinatorial search problems, eventually
focusing on an algorithm for the subset sum problem.

This is a practice job talk, so the audience is encouraged to heckle.