Uriel Feige
E836654
Uriel Feige is an Israeli computer scientist known for his influential work in computational complexity theory, approximation algorithms, and probabilistically checkable proofs.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Uriel Feige canonical | 1 |
Statements (44)
| Predicate | Object |
|---|---|
| instanceOf |
person
ⓘ
theoretical computer scientist ⓘ |
| academicDiscipline | theoretical computer science ⓘ |
| affiliation | Weizmann Institute of Science NERFINISHED ⓘ |
| awardReceived |
Gödel Prize
NERFINISHED
ⓘ
Knuth Prize NERFINISHED ⓘ |
| citizenship | Israel ⓘ |
| countryOfCitizenship | Israel ⓘ |
| doctoralAdvisor | Noga Alon NERFINISHED ⓘ |
| doctoralStudent |
Irit Dinur
NERFINISHED
ⓘ
Oded Regev NERFINISHED ⓘ |
| educatedAt |
Hebrew University of Jerusalem
NERFINISHED
ⓘ
Weizmann Institute of Science NERFINISHED ⓘ |
| employer | Weizmann Institute of Science NERFINISHED ⓘ |
| fieldOfWork |
approximation algorithms
ⓘ
computational complexity theory ⓘ computer science ⓘ probabilistically checkable proofs ⓘ |
| gender | male ⓘ |
| hasAcademicAdvisor | Noga Alon NERFINISHED ⓘ |
| hasContribution |
Feige’s conjecture relating random 3-SAT to worst-case complexity
NERFINISHED
ⓘ
approximation algorithms for combinatorial optimization problems ⓘ development of PCP-based hardness of approximation ⓘ |
| hasResearchInterest |
graph algorithms
ⓘ
inapproximability results ⓘ probabilistic proof systems ⓘ randomized algorithms ⓘ |
| knownFor |
Feige’s conjecture on random 3-SAT
NERFINISHED
ⓘ
hardness of approximation results ⓘ work on approximation algorithms ⓘ work on computational complexity theory ⓘ work on probabilistically checkable proofs ⓘ |
| languageOfWorkOrName |
English
ⓘ
Hebrew ⓘ |
| memberOf | Department of Computer Science and Applied Mathematics at Weizmann Institute of Science NERFINISHED ⓘ |
| notableStudent |
Irit Dinur
NERFINISHED
ⓘ
Oded Regev NERFINISHED ⓘ |
| notableWork |
Feige’s threshold conjecture for random 3-SAT
NERFINISHED
ⓘ
results on hardness of approximation ⓘ results on probabilistically checkable proofs ⓘ |
| occupation |
researcher
ⓘ
university teacher ⓘ |
| positionHeld | professor at Weizmann Institute of Science ⓘ |
| workplace | Weizmann Institute of Science NERFINISHED ⓘ |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.