Best Pcps
Updated Daily
Top Ranked
Best
1
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...
2
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...
You've reached the end — 2 items
