Karp R.M. Combonatorics, complexity and randomness

Paper in Communications of the ACM, February 1986 Volume 29 Number 2The 1985 Turing Award winner presents his perspective on the development of the field that has come to be called theoretical computer science.I am honored and pleased to be the recipient of this year's Turing Award. As satisfying as it is to receive such recognition, I find that my greatest satisfaction as a researcher has stemmed from doing the research itself. and from the friendships I have formed along the way. I would like to roam with you through my 25 years as a researcher in the field of combinatorial algorithms and computational complexity, and tell you about some of the concepts that have seemed important to me, and about some of the people who have inspired and influenced me.