Richard Karp
E121454
Richard Karp is a renowned American computer scientist best known for his foundational work in computational complexity theory and combinatorial algorithms, including the theory of NP-completeness.
All labels observed (3)
| Label | Occurrences |
|---|---|
| Richard M. Karp | 7 |
| Richard Karp canonical | 6 |
| Richard Manning Karp | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1031121 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Richard Karp Context triple: [Michael Sipser, doctoralAdvisor, Richard Karp]
-
A.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
B.
Manuel Blum
Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
-
C.
Leonard Adleman
Leonard Adleman is an American computer scientist and cryptographer best known as one of the co-inventors of the RSA public-key cryptosystem.
-
D.
Michael Sipser
Michael Sipser is an American theoretical computer scientist known for his influential work in computational complexity theory and for authoring a widely used textbook on the theory of computation.
-
E.
Johan Håstad
Johan Håstad is a Swedish theoretical computer scientist renowned for his groundbreaking work in computational complexity theory, particularly optimal inapproximability results and contributions to the PCP theorem.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Richard Karp Target entity description: Richard Karp is a renowned American computer scientist best known for his foundational work in computational complexity theory and combinatorial algorithms, including the theory of NP-completeness.
-
A.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
B.
Manuel Blum
Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
-
C.
Leonard Adleman
Leonard Adleman is an American computer scientist and cryptographer best known as one of the co-inventors of the RSA public-key cryptosystem.
-
D.
Michael Sipser
Michael Sipser is an American theoretical computer scientist known for his influential work in computational complexity theory and for authoring a widely used textbook on the theory of computation.
-
E.
Johan Håstad
Johan Håstad is a Swedish theoretical computer scientist renowned for his groundbreaking work in computational complexity theory, particularly optimal inapproximability results and contributions to the PCP theorem.
- F. None of above. chosen
Statements (48)
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Richard Karp Description of subject: Richard Karp is a renowned American computer scientist best known for his foundational work in computational complexity theory and combinatorial algorithms, including the theory of NP-completeness.
Referenced by (14)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Richard Karp
linked to: Richard Karp
linked to: Richard Karp
linked to: Richard Karp
subject linked to:
"Reducibility Among Combinatorial Problems" (1972)
linked to: Richard Karp
subject linked to:
"Reducibility Among Combinatorial Problems" (1972)
subject linked to:
Karp reductions
linked to: Richard Karp
subject linked to:
Karp reductions
linked to: Richard Karp
linked to: Richard Karp