18.314 Combinatorial Analysis, Fall 2005
Name
18-314-fall-2005/contents/index.htm
Size
33 KB
Format
HTML
Checksum (MD5)
49029d0c0977e75c6a30c9abba55bcb8
Author(s)
Postnikov, Alexander
Alternative Title
Combinatorial Analysis
Date Issued
December 2005
Abstract
This course analyzes combinatorial problems and methods for their solution. Prior experience with abstraction and proofs is helpful. Topics include: Enumeration, generating functions, recurrence relations, construction of bijections, introduction to graph theory, network algorithms and, extremal combinatorics.
Subjects
Combinatorial problems methods solution
Enumeration
generating functions
recurrence relations
construction of bijections
Introduction to graph theory
Network algorithms
extremal combinatorics
Enumeration
generating functions
Enumeration, generating functions
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Persistent DSpace Link
