南京大学计算机科学与技术系

软件新技术与产业化协同创新中心

摘 要：

We prove that for every 3-player (3-prover) game, with binary questions and answers and value < 1, the value of the n-fold parallel repetition of the game decays polynomially fast to 0.That is, for every such game, there exists a constant c > 0, such that the value of the n-fold parallel repetition of the game is at most n^−c.

报告人简介：

Wei Zhan is a fifth year Ph.D student in the theory group of the Department of Computer Science at Princeton University, advised by Prof. Ran Raz. His research interest lies in computational complexity theory, quantum computation and analysis of boolean functions.

时间：2月23日(星期三) 10:00

腾讯会议ID：613 361 889