Uriel Feige
Uriel Feige · Technology & Engineering
Israeli theorist of approximation hardness and probabilistically checkable proofs; Gödel Prize (2001)
2001
Israel (Weizmann Institute of Science, Rehovot)
Uriel Feige is recognized among Israeli contributors to Technology & Engineering — Israeli theorist of approximation hardness and probabilistically checkable proofs; Gödel Prize (2001)
Feige is an Israeli theoretical computer scientist at the Weizmann Institute whose work on probabilistically checkable proofs and the hardness of approximation showed that for many optimisation problems even finding a good approximate answer is computationally intractable; he shared the 2001 Gödel Prize for the PCP theorem and its applications. His results are cornerstones of modern complexity theory. He is an Israeli scientist and appears in indexes of Jewish scientists.
Verify and go deeper with these external references.
Source: Jinfo.org — Jewish recipients of the Gödel Prize
This page is published in seven languages from an English source. The translations are reviewed, but a mistake can still slip through. If you spot one on this profile — a wrong word, a lost date, a sentence that says something the English does not — please tell us.
Israeli theorist of approximation hardness and probabilistically checkable proofs; Gödel Prize (2001)
Source: Jinfo.org — Jewish recipients of the Gödel Prize