Shmuel Safra: Difference between revisions
No edit summary |
|||
| Line 21: | Line 21: | ||
}} |
}} |
||
'''Shmuel Safra''' ({{lang-he|שמואל ספרא}}) is an Israeli computer scientist. He is a Professor of [[Computer Science]] at [[Tel Aviv University]], [[Israel]]. |
'''Shmuel Safra''' ({{lang-he|שמואל ספרא}}) is an Israeli computer scientist. He is a Professor of [[Computer Science]] at [[Tel Aviv University]], [[Israel]]. in [[Jerusalem]]. |
||
Safra's research areas include [[Computational complexity theory|complexity theory]] and [[automata theory]]. His work in Complexity Theory includes the classification of approximation problems—showing them [[Np hard|NP-hard]] even for weak factors of approximation—and the theory of [[PCP (complexity)|probabilistically checkable proofs (PCP)]] and the [[PCP theorem]], which gives stronger characterizations of the class [[NP (complexity)|NP]], via a membership proof that can be verified reading only a constant number of its bits. |
Safra's research areas include [[Computational complexity theory|complexity theory]] and [[automata theory]]. His work in Complexity Theory includes the classification of approximation problems—showing them [[Np hard|NP-hard]] even for weak factors of approximation—and the theory of [[PCP (complexity)|probabilistically checkable proofs (PCP)]] and the [[PCP theorem]], which gives stronger characterizations of the class [[NP (complexity)|NP]], via a membership proof that can be verified reading only a constant number of its bits. |
||
Revision as of 14:31, 14 May 2015
Shmuel Safra | |
|---|---|
| Born | |
| Alma mater | Ph.D. Weizmann Institute of Science 1990 |
| Awards | Gödel Prize |
| Scientific career | |
| Fields | Computer science, complexity theory |
| Institutions | Tel Aviv University |
| Doctoral advisor | Amir Pnueli |
Shmuel Safra (Hebrew: שמואל ספרא) is an Israeli computer scientist. He is a Professor of Computer Science at Tel Aviv University, Israel. He was born in Jerusalem.
Safra's research areas include complexity theory and automata theory. His work in Complexity Theory includes the classification of approximation problems—showing them NP-hard even for weak factors of approximation—and the theory of probabilistically checkable proofs (PCP) and the PCP theorem, which gives stronger characterizations of the class NP, via a membership proof that can be verified reading only a constant number of its bits.
His work on automata theory investigates determinization and complementation of finite automata over infinite strings, in particular, the complexity of such translation for Büchi automata, Streett automata and Rabin automata.
In 2001, Safra won the Gödel Prize in theoretical computer science for his papers "Interactive Proofs and the Hardness of Approximating Cliques" and "Probabilistic Checking of Proofs: A New Characterization of NP".