13 citations · 31 across the 6 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2012★ 11 cited
A direct product theorem for bounded-round public-coin randomized communication complexity
Rahul Jain, Attila Pereszlenyi, Penghui Yao
In this paper, we show a direct product theorm in the model of two-party bounded-round public-coin randomized communication complexity. For a relation f subset of X times Y times Z…
cs.CC2011★ 1 cited
On quantum interactive proofs with short messages
Attila Pereszlényi
This paper proves one of the open problem posed by Beigi et al. in arXiv:1004.0411v2. We consider quantum interactive proof systems where in the beginning the verifier and prover s…