Overview
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore groundbreaking research in computational complexity theory as Anand Natarajan and John Wright present their findings on the containment of NEXP in MIP* in this 22-minute IEEE conference talk. Delve into the implications of this result for interactive proof systems and quantum computing, gaining insights into the power of multiple provers and entanglement in computational models.
Syllabus
NEXP is contained in MIP*
Taught by
IEEE FOCS: Foundations of Computer Science