Explore >> Select a destination
|
You are here 
|
mycqstate.wordpress.com | ||
| | | | |
simons.berkeley.edu
|
|
| | | | | This workshop will focus on quantum interactive proofs and entangled quantum games. It will include recent advances in our understanding of the complexity class QMIP of multiple entangled provers, as well as QPIP, quantum polynomial time bounded provers. The workshop will also address quantum PCP from an interactive proof perspective. Enquiries may be sent to the organizers workshop_qhc1 [at] lists.simons.berkeley.edu (at this address.) | |
| | | | |
www.scottaaronson.com
|
|
| | | | | ||
| | | | |
gilkalai.wordpress.com
|
|
| | | | | Yael Tauman Kalai: Delegating Computation via No-Signaling Strategies. Ladies and Gentelmen, Here is, exclusively for our readers, Yael Tauman Kalai's ICM2018 paper: Delegating Computation via No-Signaling Strategies. The opportunity to present the paper arose when a week ago I attended a great lecture on game theory by Yair Tauman and met there Adam Kalai, Yael, | |
| | | | |
rjlipton.com
|
|
| | | How to convince someone your proof is really a proof Roger Apéry was a mathematician who solved a beautiful problem that had been open for hundreds of years. He was not an amateur in any sense, but because his result was so surprising there was initial doubt about its correctness. Even professional mathematicians have some... | ||
