NEXP is Contained in MIP* - Complexity Theory Breakthrough
Offered By: IEEE via YouTube
Course Description
Overview
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
Tags
Related Courses
Fully Linear PCPs and Their Cryptographic ApplicationsSimons Institute via YouTube How to Do Fiat-Shamir in the Standard Model
Simons Institute via YouTube How to Delegate Computations Publicly
Simons Institute via YouTube Transparent SNARKs from DARK Compilers
Simons Institute via YouTube On Prover-Efficient Public-Coin Emulation of Interactive Proofs
Paul G. Allen School via YouTube