Geburtsdatum | Mittwoch, 04. Oktober 1961 |
Todesdatum | Dienstag, 29. Oktober 2024 |
Sternzeichen | |
Beschreibung | 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. |
