18.211 Combinatorial Analysis
Combinatorial problems and methods for their solution. Enumeration, generating functions, recurrence relations, construction of bijections. Introduction to graph theory. Prior experience with abstraction and proofs is helpful.
18.211 will be offered this semester (Fall 2017). It is instructed by M. Rahman.
Lecture occurs 2:00 PM to 3:00 PM on Mondays, Wednesdays and Fridays in 2-147.
This class counts for a total of 12 credits.
You can find more information at the MIT + 18.211 - Google Search site.
© Copyright 2015 Yasyf Mohamedali