Read our cookies policy and privacy statement for more information.
×Denver, Colorado•
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 is not applicable toward any degree in the College of Liberal Arts and Sciences. Note: this course assumes that students have completed MATH 3000 or equivalent. Cross-listed with MATH 4409.
Units: 3.0
Hours: 3 to 3