tag:blogger.com,1999:blog-3722233.post115685773077657215..comments2024-03-27T19:58:17.387-05:00Comments on Computational Complexity: Parallel Repetition ReduxLance Fortnowhttp://www.blogger.com/profile/06752030912874378610noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-3722233.post-1156862823278524202006-08-29T09:47:00.000-05:002006-08-29T09:47:00.000-05:00And Holenstein's proof also considers the no-signa...And Holenstein's proof also considers the no-signalling case, although you can proof the no-signalling case using Raz's proof too.Anonymousnoreply@blogger.com