Digital Media Services | Events

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

Tel-Aviv University
  • Lecturer(s): Subhash Khot (NYU)
  • Location: Jaglom Auditorium
  • Date: Monday, 30 December 2019
Published in
You are here:Computers/TAU Theory-Fest/Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theorem

Video services are provided by the Computing Division Video Team.

Video services are provided by the Computing Division Video Team.

© Tel Aviv University 2024, All Rights Reserved.

Back to Top