How to Cheat at “Who Wants to Be a Millionaire?” (and Show Non-Hardness of GapMCSP)
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=_PBcVSOowEw
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
Other Videos By Simons Institute for the Theory of Computing
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