next up previous contents
Next: Lecture notes and supplementary Up: Info-page on CGC Block Previous: Course description

Recommended readings before the lecture

 It is very hard to write down specific prerequisites for this course. In a sense it is selfcontained, since we introduce axioms and work with them from scratch. Yet, our axioms, theorems and constructions are often motivated by well-known facts on convex sets and linear optimization problems in Rn. Thus everyone taking this course is highly recommended to review fundamental concepts and theorems on convexity and linear optimization. Also, those with no prior knowledge of complexity theory would profit from reading an introduction to the notions of complexity classes P, NP, co-NP and NP-complete.


Here are some recommended readings:


Those more computationally oriented may want to look at some additional materials (for Fukuda's part):


next up previous contents
Next: Lecture notes and supplementary Up: Info-page on CGC Block Previous: Course description
Komei Fukuda
12/14/2000