Main Profile

At A Glance

Combinatorial Analysis

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.

Start Date: Sep 01, 2005
Cost: Free

Contact

Combinatorial Analysis's Full Profile

Overview

Description

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.

Details

  • Dates: Sep 01, 2005 to Dec 20, 2005
  • Days of the Week: Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday
  • Level of Difficulty: Beginner
  • Size: Massive Open Online Course
  • Instructor: Prof. Alexander Postnikov
  • Cost: Free
  • Institution: MIT OCW

Provider Overview

About MIT OCW: MIT OpenCourseWare (OCW) is a web-based publication of virtually all MIT course content. OCW is open and available to the world and is a permanent MIT activity.

Latest Tweet

Questions about Combinatorial Analysis

Want more info about Combinatorial Analysis? Get free advice from education experts and Noodle community members.

  • Answer