Generating Functions, Algorithms, and the Frobenius Problem
|Event Start Date||Monday, February 6, 2012|
Serra Hall, Room 104B
|Event Start Time||2:50 pm - 3:20 pm|
Generating Functions, Algorithms, and the Frobenius ProblemPresented by Professor Kevin Woods, Oberlin College
Then we'll discuss at a variety of related questions and future research directions. In general, generating functions can often encode a seemingly complicated set (such as the set of postal rates that can be paid with a cent and b cent stamps) in a nice, compact form. Then we can use the generating functions to answer questions like "Is this set nonempty?" "What is its cardinality?" "What is its maximal element?" We will approach these problems from an algorithmic perspective: what can we do "quickly" (that is, in polynomial time)?
|Contact||Amy Prout | firstname.lastname@example.org | 619-260-4706|