Narendra Karmarkar
E568397
Narendra Karmarkar is an Indian mathematician and computer scientist best known for developing Karmarkar's algorithm, a groundbreaking polynomial-time method for linear programming.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Narendra Karmarkar canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T6093834 — 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: Narendra Karmarkar Context triple: [Banaras Hindu University, hasNotableAlumni, Narendra Karmarkar]
-
A.
Laxman Narasimhan
Laxman Narasimhan is an Indian-American business executive best known as the chief executive officer of Starbucks and former CEO of Reckitt Benckiser.
-
B.
Abhijit Vinayak Banerjee
Abhijit Vinayak Banerjee is an Indian-American economist and Nobel laureate renowned for his experimental approach to alleviating global poverty.
-
C.
Subra Suresh
Subra Suresh is an Indian-American engineer, materials scientist, and academic leader known for his pioneering work in the mechanics of materials and for serving as director of the U.S. National Science Foundation and president of Carnegie Mellon University.
-
D.
Sitaram Tiwari
Sitaram Tiwari was the father of Indian revolutionary freedom fighter Chandrasekhar Azad.
-
E.
R. A. Mashelkar
R. A. Mashelkar is a renowned Indian chemical engineer and former Director General of the Council of Scientific and Industrial Research (CSIR), known for his contributions to polymer science, science policy, and innovation in India.
- 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: Narendra Karmarkar Target entity description: Narendra Karmarkar is an Indian mathematician and computer scientist best known for developing Karmarkar's algorithm, a groundbreaking polynomial-time method for linear programming.
-
A.
Laxman Narasimhan
Laxman Narasimhan is an Indian-American business executive best known as the chief executive officer of Starbucks and former CEO of Reckitt Benckiser.
-
B.
Abhijit Vinayak Banerjee
Abhijit Vinayak Banerjee is an Indian-American economist and Nobel laureate renowned for his experimental approach to alleviating global poverty.
-
C.
Subra Suresh
Subra Suresh is an Indian-American engineer, materials scientist, and academic leader known for his pioneering work in the mechanics of materials and for serving as director of the U.S. National Science Foundation and president of Carnegie Mellon University.
-
D.
Sitaram Tiwari
Sitaram Tiwari was the father of Indian revolutionary freedom fighter Chandrasekhar Azad.
-
E.
R. A. Mashelkar
R. A. Mashelkar is a renowned Indian chemical engineer and former Director General of the Council of Scientific and Industrial Research (CSIR), known for his contributions to polymer science, science policy, and innovation in India.
- F. None of above. chosen
Statements (42)
| Predicate | Object |
|---|---|
| instanceOf |
Indian computer scientist
ⓘ
Indian mathematician ⓘ mathematician ⓘ person ⓘ |
| algorithmComplexity | polynomial time ⓘ |
| almaMater |
Caltech
NERFINISHED
ⓘ
IIT Bombay NERFINISHED ⓘ |
| award |
Fulkerson Prize
NERFINISHED
ⓘ
US National Academy of Engineering membership NERFINISHED ⓘ |
| citizenship | India ⓘ |
| contribution |
developed a polynomial-time algorithm for linear programming
ⓘ
introduced a new class of interior-point methods ⓘ |
| countryOfBirth | India NERFINISHED ⓘ |
| degree | PhD in computer science ⓘ |
| developedIn | 1980s ⓘ |
| education |
California Institute of Technology
NERFINISHED
ⓘ
Indian Institute of Technology Bombay NERFINISHED ⓘ |
| employer | AT&T Bell Laboratories NERFINISHED ⓘ |
| era |
20th-century mathematics
ⓘ
21st-century mathematics ⓘ |
| field |
computer science
ⓘ
mathematics ⓘ operations research ⓘ optimization ⓘ |
| impact | significantly improved practical performance of linear programming solvers ⓘ |
| influencedBy | linear programming theory prior to interior-point methods ⓘ |
| influencedField |
combinatorial optimization
ⓘ
linear programming ⓘ theory of algorithms ⓘ |
| knownFor |
Karmarkar's algorithm
NERFINISHED
ⓘ
interior-point methods for linear programming ⓘ |
| membership | National Academy of Engineering (United States) NERFINISHED ⓘ |
| nationality | Indian ⓘ |
| notableConcept | projective scaling transformation in linear programming ⓘ |
| notableWork | Karmarkar's algorithm for linear programming NERFINISHED ⓘ |
| occupation |
computer scientist
ⓘ
mathematician ⓘ |
| publicationTopic |
interior-point methods
ⓘ
linear programming algorithms ⓘ |
| researchArea |
algorithms
ⓘ
complexity theory ⓘ numerical optimization ⓘ |
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: Narendra Karmarkar Description of subject: Narendra Karmarkar is an Indian mathematician and computer scientist best known for developing Karmarkar's algorithm, a groundbreaking polynomial-time method for linear programming.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.