Steven Rudich

Steven Rudich (born October 4, 1961) is a professor in the Carnegie Mellon School of Computer Science. In 1994, he and Alexander Razborov proved that a large class of combinatorial arguments, dubbed natural proofs, was unlikely to answer many of the important problems in computational complexity theory. For this work, they were awarded the Gödel Prize in 2007. He also co-authored a paper demonstrating that all currently known NP-complete problems remain NP-complete even under AC0 or NC0 reductions.

Steven Rudich
Born (1961-10-04) October 4, 1961
AwardsGödel Prize
Academic work
DisciplineComputer Science
Sub-disciplineComputational complexity theory
InstitutionsCarnegie Mellon
Notable ideasNatural proof
Websitehttps://www.cs.cmu.edu/~rudich/

Amongst Carnegie Mellon students, he is best known as the teacher of the class "Great Theoretical Ideas in Computer Science" (formerly named "How to Think Like a Computer Scientist"), often considered one of the most difficult classes in the undergraduate computer science curriculum. He is an editor of the Journal of Cryptology, as well as an accomplished magician. His Erdős number is 2.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.