Read our cookies policy and privacy statement for more information.
×Denver, Colorado•
Every other year. Major emphasis is on applied combinatorics and combinatorial algorithms, with applications in computer science and operations. Topics include general counting methods, generating functions, recurrence relations, inclusion-exclusion, and block designs. Note: This course assumes that students have taken MATH 3000. Students who have a grade of B- or better in MATH 3000 pass this course at a much higher rate. Cross-listed with MCKE 5409. Term offered: fall.
Units: 3.0
Hours: 3 to 3