Top Results for Hardness Of Approximation
Subhash Khot is a professor of computer science at New York University's Courant Institute of Mathematical Sciences. In 2002 he proposed the Unique Games Conjecture, a hypothesis about the hardness of approximating certain constraint satisfaction problems that has become one of the most influential...
Why this score
Unique Games Conjecture reshaped approximation hardness research; major theoretical impact despite unresolved status.
Scoring methodology
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.
Scoring methodology
