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
理论计算机科学基础 | Introduction to Theoretical Computer SciencePeking University via edX 算法设计与分析(高级) | Advanced Design and Analysis of Algorithms
Peking University via edX The Introduction to Quantum Computing
Saint Petersburg State University via Coursera Computational Complexity Theory
Indian Institute of Technology Kanpur via Swayam Computational Complexity
IIT Hyderabad via Swayam