Subhash Khot is a prominent theoretical computer scientist known for his contributions to complexity theory and approximation algorithms. He is a professor at New York University and has conducted significant research in areas such as hardness of approximation, interactive proof systems, and the development of algorithms. He is particularly recognized for his work on the PCP theorem (Probabilistically Checkable Proofs) and for advances in the field of quantum computing.
Articles by others on the same topic
There are currently no matching articles.