Professor Gacs has translated (from Hungarian) and extensively amended
notes on Computation Complexity by Laszlo Lovasz. These notes
have been used several times to teach CS535, and much of the material they
cover is outside the scope of the present course. However,
some sections of the notes fit nicely in a graduate course
on Algorithms and, despite their overlap with the book by
Cormen, Leiserson and Rivest, provide a useful and different
viewpoint.
We will excerpt relevant sections from Professor Gacs' notes
and make them available to students as the need arises. The first
installment is the table of contents (for comparison purposes).
Assaf Kfoury
Created: 95.01.18