
Steven Rudich
Use attributes for filter ! | |
Gender | Male |
---|---|
Age | 63 |
Date of birth | October 4,1961 |
Zodiac sign | Libra |
Academic employer | Carnegie Mellon University |
Affiliations | Carnegie Mellon University |
Notabl idea | Natural proof |
Notable student | James Aspnes |
Awards | Gödel Prize |
Academic advisor | Manuel Blum |
Academic institution | Carnegie Mellon University |
Interests | Computational Complexity Theory |
Cryptography | |
Nationality | American |
H index | 24 |
Date of Reg. | |
Date of Upd. | |
ID | 728919 |
Steven Rudich Life story
Steven Rudich 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.