Leonid Levin
E572330
Leonid Levin is a Soviet-American computer scientist known as a co-founder of complexity theory and for independently formulating the P versus NP problem.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Leonid Levin canonical | 4 |
How this entity was disambiguated
This entity first appeared as the object of triple T5892238 — 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: Leonid Levin Context triple: [P versus NP problem, introducedBy, Leonid Levin]
-
A.
Lev Shlosberg
Lev Shlosberg is a Russian liberal politician, journalist, and human rights advocate known for his opposition to the Kremlin and his work within the Yabloko party.
-
B.
Evgeny Lifshitz
Evgeny Lifshitz was a Soviet theoretical physicist best known for co-authoring the influential multi-volume "Course of Theoretical Physics" and for his contributions to general relativity and cosmology.
-
C.
Evgeny Levinson
Evgeny Levinson was a Soviet architect known for designing significant memorial and monumental complexes, particularly in Leningrad (now Saint Petersburg).
-
D.
Yurii Rubinsky
Yurii Rubinsky was a pioneering Canadian technologist, publisher, and early advocate of SGML and open digital standards who significantly influenced the development of electronic publishing.
-
E.
Mikhail Bronshtein
Mikhail Bronshtein is a notable individual who shares the surname Bronstein, which is associated with several prominent figures in fields such as mathematics, physics, and chess.
- 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: Leonid Levin Target entity description: Leonid Levin is a Soviet-American computer scientist known as a co-founder of complexity theory and for independently formulating the P versus NP problem.
-
A.
Lev Shlosberg
Lev Shlosberg is a Russian liberal politician, journalist, and human rights advocate known for his opposition to the Kremlin and his work within the Yabloko party.
-
B.
Evgeny Lifshitz
Evgeny Lifshitz was a Soviet theoretical physicist best known for co-authoring the influential multi-volume "Course of Theoretical Physics" and for his contributions to general relativity and cosmology.
-
C.
Evgeny Levinson
Evgeny Levinson was a Soviet architect known for designing significant memorial and monumental complexes, particularly in Leningrad (now Saint Petersburg).
-
D.
Yurii Rubinsky
Yurii Rubinsky was a pioneering Canadian technologist, publisher, and early advocate of SGML and open digital standards who significantly influenced the development of electronic publishing.
-
E.
Mikhail Bronshtein
Mikhail Bronshtein is a notable individual who shares the surname Bronstein, which is associated with several prominent figures in fields such as mathematics, physics, and chess.
- F. None of above. chosen
Statements (35)
| Predicate | Object |
|---|---|
| instanceOf |
human
ⓘ
mathematician ⓘ theoretical computer scientist ⓘ |
| co-discovered | NP-completeness of certain search problems ⓘ |
| co-formulated | P versus NP problem NERFINISHED ⓘ |
| countryOfCitizenship |
Soviet Union
ⓘ
United States of America ⓘ |
| educatedAt | Moscow State University ⓘ |
| employer | Boston University NERFINISHED ⓘ |
| fieldOfWork |
algorithm theory
ⓘ
computational complexity theory ⓘ cryptography ⓘ theoretical computer science ⓘ |
| hasResearchInterest |
Kolmogorov complexity
NERFINISHED
ⓘ
NP-complete problems ⓘ P versus NP problem NERFINISHED ⓘ randomized algorithms ⓘ |
| influenced |
research in computational complexity theory
ⓘ
research on NP-completeness ⓘ |
| influencedBy |
Alan Turing
NERFINISHED
ⓘ
Andrey Kolmogorov NERFINISHED ⓘ |
| languageSpoken |
English
ⓘ
Russian ⓘ |
| notableFor |
Levin reduction
NERFINISHED
ⓘ
Levin search NERFINISHED ⓘ co-founding complexity theory ⓘ independent formulation of the P versus NP problem ⓘ work on NP-completeness ⓘ work on average-case complexity ⓘ work on randomness in computation ⓘ |
| notableIdea |
Levin reduction in complexity theory
NERFINISHED
ⓘ
universal search algorithm (Levin search) NERFINISHED ⓘ |
| occupation | university professor ⓘ |
| workLocation |
Moscow
ⓘ
United States of America ⓘ
surface form:
United States
|
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: Leonid Levin Description of subject: Leonid Levin is a Soviet-American computer scientist known as a co-founder of complexity theory and for independently formulating the P versus NP problem.
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.