Sciweavers

STOC
1997
ACM
116views Algorithms» more  STOC 1997»
13 years 8 months ago
Direct Product Results and the GCD Problem, in Old and New Communication Models
This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:
Itzhak Parnafes, Ran Raz, Avi Wigderson
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
13 years 10 months ago
On the Power of Quantum Proofs
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
Ran Raz, Amir Shpilka