• Facets (new session)
• Description
• Metadata
• Settings
  • Rule: ActivityStreamsMapasEquivalentb3sb3sifpdbprdf-labelfacetshttp://dbpedia.org/resource/inference/rules/dbpedia#http://dbpedia.org/resource/inference/rules/opencyc#http://dbpedia.org/resource/inference/rules/umbel#http://dbpedia.org/resource/inference/rules/yago#http://dbpedia.org/schema/property_rules#http://www.ontologyportal.org/inference/rules/SUMO#http://www.ontologyportal.org/inference/rules/WordNet#http://www.w3.org/2002/07/owl#ldpoplwebskos-transurn:det:rdf:labelvirtrdf-labelvirtrdf-urlNone
    
  • Inverse Functional Properties: Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects
  • "Same As": Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects (recommended) Apply to subjects, objects and predicates (not recommended on big datasets) Apply to predicates only (special use cases only)

About: Shmuel Safra     Goto   Sponge   NotDistinct   Permalink

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

Type: Thingfoaf:Personpersondul:NaturalPersonEukaryotePersonHumanAnimalanimaleukaryotescientistspeciesyago:WikicatComputerScientistsschema:Personyago:WikicatLivingPeopleyago:WikicatTheoreticalComputerScientistsyago:WikicatPeopleFromJerusalemScientistyago:Acquirer109764201yago:CausalAgent100007347yago:ComputerScientist109951070yago:ComputerUser109951274yago:Honoree110183757yago:Intellectual109621545yago:Laureate110249011yago:LivingThing100004258yago:Object100002684yago:Organism100004475yago:Person100007846yago:PhysicalEntity100001930yago:Recipient109627906yago:WikicatGödelPrizeLaureatesyago:WikicatIsraeliComputerScientistsyago:WikicatIsraeliInformationTheoristsyago:WikicatIsraeliPeopleyago:YagoLegalActoryago:YagoLegalActorGeoyago:Scientist110560637yago:Theorist110706812yago:Whole100003553 New Facet based on Instances of this Class

Shmuel Safra (Hebrew: שמואל ספרא) is an Israeli computer scientist. He is a Professor of Computer Science at Tel Aviv University, Israel. He was born in Jerusalem. Safra's research areas include complexity theory and automata theory. His work in complexity theory includes the classification of approximation problems—showing them NP-hard even for weak factors of approximation—and the theory of probabilistically checkable proofs (PCP) and the PCP theorem, which gives stronger characterizations of the class NP, via a membership proof that can be verified reading only a constant number of its bits.