About: Arora, Sanjeev

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Arora, Sanjeev Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : platform.yourdatastories.eu:8890 associated with source document(s)

Sanjeev Arora (born January 1968) is an Indian American theoretical computer scientist who is best known for his work on probabilistically checkable proofs and, in particular, the PCP theorem. He is currently the Charles C.

Attributes	Values
rdfs:comment	Sanjeev Arora (born January 1968) is an Indian American theoretical computer scientist who is best known for his work on probabilistically checkable proofs and, in particular, the PCP theorem. He is currently the Charles C.
foaf:name	Arora, Sanjeev Sanjeev Arora
foaf:depiction
dc:description	Theoretical computer scientist
alma mater	Massachusetts Institute of Technology University of California, Berkeley
award	dbpedia:Fulkerson_Prize dbpedia:Gödel_Prize
birth place	India Rajasthan Jodhpur
birth year	1968-01-01(xsd:dateTime)
citizenship	United States
doctoral advisor	Umesh Vazirani
field	dbpedia:Theoretical_computer_science
known for	dbpedia:PCP_theorem dbpedia:Probabilistically_checkable_proof
notable student	Khot, Subhash
residence	United States
thumbnail	http://commons.wikimedia.org/wiki/Special:FilePath/Sanjeev_Arora.jpg?width=300
is doctoral advisor of	Khot, Subhash
is doctoral student of	Umesh Vazirani

Faceted Search & Find service v1.13.91 as of Nov 14 2017

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3212 as of Mar 29 2016, on Linux (x86_64-unknown-linux-gnu), Single-Server Edition (68 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software