Theoretical Computer Science: Is The Questioner In An Interactive Proof Able To Query Multiple Omniscient Respondents..?
Twenty years ago, researchers showed that if the questioner in an interactive proof is able to query multiple omniscient respondents — which are unable to communicate with each other — it can extract information much more efficiently than it could from a single respondent... |
|
