Previous slide Next slide Back to the first slide View text version


Notes:

-There are several good theorems in other areas of theory and computer science. However, I have my expertise in computational complexity theory. I would not make a good judge in other areas.

- It would not be fair to judge theorems before I was actively involved in complexity theory.

-Theorems chosen for importance of result, originality and difficulty of technique and relationships with other results in complexity theory.

-No theorems proven at The University of Chicago: I do not want to play favorites.

- Theorems chosen for diversity: I wanted to get a representation of many different areas of complexity theory.

- Theorems chosen as results instead of for people: I did not make any attempt to choose people, instead I chose results that I enjoyed.

- Theorems presented in rough chronological order