1. Home
  2. Material Detail: 18.314 Combinatorial Analysis

Material Detail

18.314 Combinatorial Analysis

18.314 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.
Disciplines:
Go to Material 
Bookmark / Add to Course ePortfolio
Create a Learning Exercise
Add Accessibility Information
Rate
Add a Comment

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Material Type:
Online Course
Date Added to MERLOT:
October 20, 2011
Date Modified in MERLOT:
June 12, 2018
Author:
Submitter:
Sorel Reisman
Primary Audience:
College General Ed, College Lower Division
Mobile Compatibility:
Not specified at this time
Language:
English
Cost Involved:
No
Source Code Available:
Unknown
Creative Commons:
Creative Commons License
This work is licensed under a Attribution-NonCommercial-ShareAlike 3.0 United States

Browse...

Disciplines with similar materials as 18.314 Combinatorial Analysis
People who viewed this also viewed
Other materials like 18.314 Combinatorial Analysis

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.