A course designed for mathematics and computer science majors. Topics include combinatorics, graphs and networks, analysis of algorithms, generating functions and recurrence relations, graph coloring, satisfiability, computational complexity, automata and languages, Turing machines and computability, and a brief introduction to the theory of NP-completeness. Prerequisite: MAT 261 or MAT 262 or permission.
[Previous] | MAT 459 : Methods of Applied Mathematics I |
[Next] | MAT 487 : Numerical Analysis |
[Up] | Applied Math, Operations Research, Mathematical Modeling |
[Home] | Home Page |
[Mail] | Send EMail to Maine Math Talent Search |
[Contents] | Maine Math Talent Search Contents |
Last modified on Tuesday, January 12, 1999