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 were unlikely to answer many of the important problems in computational complexity theory. For this work, they were awarded the Gödel prize in 2007.
| Property | Value |
|---|
| dbpedia-owl:thumbnail
| |
| dbpprop:abstract
|
- 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 were unlikely to answer many of the important problems in computational complexity theory. For this work, they were awarded the Gödel prize in 2007. 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.
|
| dbpprop:hasPhotoCollection
| |
| dbpprop:reference
| |
| rdf:type
| |
| rdfs:comment
|
- 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 were unlikely to answer many of the important problems in computational complexity theory. For this work, they were awarded the Gödel prize in 2007.
|
| rdfs:label
| |
| owl:sameAs
| |
| skos:subject
| |
| foaf:depiction
| |
| foaf:page
| |
| is dbpedia-owl:Scientist/doctoralStudent
of | |
| is dbpedia-owl:doctoralStudent
of | |
| is dbpprop:quotationProperty
of | |
| is owl:sameAs
of | |
![[RDF Data]](/statics/sw-cube.png)
