How to Cheat at “Who Wants to Be a Millionaire?” (and Show Non-Hardness of GapMCSP)

Published on ● Video Link: https://www.youtube.com/watch?v=_PBcVSOowEw



Category:
Show
Duration: 23:25
321 views
3


Neekon Vafa (MIT)
https://simons.berkeley.edu/talks/how-cheat-who-wants-be-millionaire-show-non-hardness-gapmcsp
Lower Bounds, Learning, and Average-Case Complexity







Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Lower Bounds Learning and Average-Case Complexity
Neekon Vafa