Top Results for Pcps
Irit Dinur is an Israeli computer scientist at the Weizmann Institute of Science. She is best known for giving a combinatorial proof of the PCP theorem, a fundamental result in computational complexity theory that characterizes the hardness of approximation problems. Her proof was published in the J...
Why this score
Combinatorial proof of PCP theorem is a landmark; strong complexity theory reputation.
ui.x_scoring_methodology
Dana Moshkovitz is an Israeli-American theoretical computer scientist who serves as a faculty member at the University of Texas at Austin. Her primary research area is computational complexity theory, where she focuses on probabilistically checkable proofs (PCPs) and the hardness of approximation. S...
Why this score
PCP and hardness research contributions are respected; specialist theoretical impact.
ui.x_scoring_methodology
