Subhash Khot: Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theorem

Sdílet
Vložit
  • čas přidán 20. 12. 2019
  • This is a talk of Subhash Khot given given at the Harvard CDM Conference of November 23, 2019.

Komentáře • 5