MATH 584
Fall 2004 All Classes
All Classes
Credit: 4 hours.
(MATH 474) Combinatorial methods and other mathematical methods for combinatorial problems. Enumeration by bijections and generating functions, probabilistic methods for existence proofs and asymptotic analysis, randomized algorithms, Ramsey's theorem and related topics, combinatorial designs and their applications, geometric problems and methods. Same as CS 575. Prerequisite: MATH 580 or consent of instructor.
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details |
|---|