| Line 16: | Line 16: | ||
*[[Explaining_a_Clay_problem_MA375S12Walther|Explaining a Clay Problem]] | *[[Explaining_a_Clay_problem_MA375S12Walther|Explaining a Clay Problem]] | ||
*[[Coloring_problems_MA375S12Walther|Coloring Problems]] | *[[Coloring_problems_MA375S12Walther|Coloring Problems]] | ||
| + | *[[Greedy_methods_MA375S12Walther|Greedy Methods]] | ||
== Semester/Instructor specific pages == | == Semester/Instructor specific pages == | ||
*[[2012_Spring_MA_375_Walther|Sprinf 2012, Prof. Walther]] | *[[2012_Spring_MA_375_Walther|Sprinf 2012, Prof. Walther]] | ||
Revision as of 14:18, 20 September 2012
Contents
MA375: Discrete Mathematics
Peer Legacy
Share advice with future students regarding MA375 on this page.
Interesting pages in the MA375 category
- Is N=NP?
- The principle of induction and why there is no Nobel prize in math
- Special Sequences of Numbers
- Mystery of Probability
- Games and Mathematics
- The Use of Graph Theory
- Explaining a Clay Problem
- Coloring Problems
- Greedy Methods
Semester/Instructor specific pages
- Sprinf 2012, Prof. Walther
- Spring 2010, Prof. Walther
- Spring 2009, Prof. Walther
- Fall 2008, Prof. Walther
