SPRING 2001 COURSE DESCRIPTION: MATH 381: Discrete Algorithms



Discrete Algorithms is one of the most beautiful mathematics subjects. Yet it is hardly ever taught in mathematics departments.

In this course we will remedy this gap, and treat algorithms as part of mathematics per se. We will be able to appreciate the beauty and depth much more than in computer science courses, since we will not get distracted by implementation details.

We will also learn about Artificial Intelligence techniques for problem solving and theorem proving. This course is supposed to be fun! It is ideal for Math as well as CIS majors. The instructor is a great teacher and a world-class authority on combinatorial algorithms. He is also a nice guy!

Prerequisites: An open mind! (no formal background is needed).

Text: handouts