About: Steven Rudich

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Steven Rudich Goto Sponge NotDistinct Permalink

An Entity of Type : yago:Whole100003553, within Data Space : dbpedia.org associated with source document(s)

Type:

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FSteven_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.

Attributes	Values
rdf:type	Thing foaf:Person person dul:NaturalPerson Eukaryote Person Human Animal yago:WikicatAmericanComputerScientists yago:WikicatAmericanInformationTheorists yago:WikicatAmericanPeople Academic Person animal eukaryote scientist species yago:WikicatComputerScientists schema:Person yago:WikicatLivingPeople yago:Acquirer109764201 yago:CausalAgent100007347 yago:ComputerScientist109951070 yago:ComputerUser109951274 yago:Honoree110183757 yago:Intellectual109621545 yago:Laureate110249011 yago:LivingThing100004258 yago:Object100002684 yago:Organism100004475 yago:Person100007846 yago:PhysicalEntity100001930 yago:Recipient109627906 yago:WikicatGödelPrizeLaureates yago:YagoLegalActor yago:YagoLegalActorGeo yago:Scientist110560637 yago:Theorist110706812 yago:Whole100003553
rdfs:label	Steven Rudich (de) Steven Rudich (es) Steven Rudich (fr) Steven Rudich (en)
rdfs:comment	Steven Rudich, né le 4 octobre 1961, est un informaticien théoricien américain qui travaille en théorie de la complexité, cryptographie et combinatoire. Rudich obtient en 1989 un Ph. D. à l'université de Californie à Berkeley sous la direction de Manuel Blum (« Limits on the Provable Consequences of One-Way Functions »). Il est depuis le début des années 1990 professeur d'informatique à l'université Carnegie-Mellon. (fr) Steven Rudich (n. 4 de octubre de 1961) es un profesor estadounidense de la de la Universidad Carnegie Mellon. En 1994 junto con Alexander Razborov demostró que una gran clase de argumentos combinatoriales, denominados , eran improbables para responder a muchos importantes problemas de la complejidad computacional. Por este trabajo, recibieron el Premio Gödel en 2007. Es editor del , así como un consumado ilusionista. (es) Steven Rudich (* 4. Oktober 1961) ist ein US-amerikanischer Informatiker, der sich mit Komplexitätstheorie, Kryptographie und Kombinatorik beschäftigt. Rudich promovierte 1989 an der University of California, Berkeley bei Manuel Blum (Limits on the Provable Consequences of One-Way Functions) und ist seit Anfang der 1990er Jahre Professor für Informatik an der Carnegie Mellon University. Er ist Herausgeber des Journal of Cryptography. Rudich ist Amateur-Zauberer. (de) 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. (en)
foaf:name	Steven Rudich (en)
foaf:homepage	https://www.cs.cmu.edu/~rudich/
name	Steven Rudich (en)
birth date	1961-10-04 (xsd:date)
dcterms:subject	Living people American computer scientists Carnegie Mellon University faculty Gödel Prize laureates 1961 births
Wikipage page ID	1822947 (xsd:integer)
Wikipage revision ID	1087305813 (xsd:integer)
Link from a Wikipage to another Wikipage	List of people by Erdős number Living people Computer Science NP-complete Computational complexity theory Magician (illusion) American computer scientists Carnegie Mellon University faculty Gödel Prize laureates Gödel Prize Alexander Razborov 1961 births Journal of Cryptology Georgia Tech Carnegie Mellon Carnegie Mellon School of Computer Science Natural proof dbr:Merrick_L._Furst
Link from a Wikipage to an external page	http://andrewsleap.blogspot.com/ https://www.cs.cmu.edu/~leap/ https://www.cs.cmu.edu/~rudich/
sameAs	Steven Rudich Steven Rudich Steven Rudich Steven Rudich Steven Rudich Steven Rudich Steven Rudich Steven Rudich Steven Rudich Steven Rudich Steven Rudich
sub discipline	Computational complexity theory
workplaces	Carnegie Mellon
dbp:wikiPageUsesTemplate	dbt:DBLP dbt:Authority_control dbt:Citation_needed dbt:Reflist dbt:Short_description dbt:Birth_date_and_age dbt:Infobox_academic dbt:Gödel_winners
awards	Gödel Prize

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 56 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software