-
1
-
-
0039299842
-
The Communication Complexity of Enumeration, Elimination, and Selection
-
Ambainis, A., Buhrman, H., Gasarch, W., Kalyanasundaram, B., Torenvliet, L.: The Communication Complexity of Enumeration, Elimination, and Selection. Journal of Computer and System Science 63(2), 148-185 (2001)
-
(2001)
Journal of Computer and System Science
, vol.63
, Issue.2
, pp. 148-185
-
-
Ambainis, A.1
Buhrman, H.2
Gasarch, W.3
Kalyanasundaram, B.4
Torenvliet, L.5
-
2
-
-
36049056258
-
-
Clauser, J., Horne, M.A., Shimony, A., Holt, R.A.: Phys. Rev. Lett. 23, 880 (1969)
-
(1969)
Phys. Rev. Lett
, vol.23
, pp. 880
-
-
Clauser, J.1
Horne, M.A.2
Shimony, A.3
Holt, R.A.4
-
3
-
-
34748922466
-
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems
-
Cleve, R., Slofstra, W., Unger, F., Upadhyay, S.: Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems. In: IEEE Conference on Computational Complexity, pp. 109-114 (2007)
-
(2007)
IEEE Conference on Computational Complexity
, pp. 109-114
-
-
Cleve, R.1
Slofstra, W.2
Unger, F.3
Upadhyay, S.4
-
4
-
-
34848901667
-
Understanding parallel repetition requires understanding foams
-
Feige, U., Kindler, G., O'Donnell, R.: Understanding parallel repetition requires understanding foams. In: IEEE Conference on Computational Complexity, pp. 179-192 (2007)
-
(2007)
IEEE Conference on Computational Complexity
, pp. 179-192
-
-
Feige, U.1
Kindler, G.2
O'Donnell, R.3
-
5
-
-
0026991175
-
Lovász: Two-prover one-round proof systems: their power and their problems
-
Feige, U.: Lovász: Two-prover one-round proof systems: their power and their problems. In: Proc. 24th ACM Symp. on Theory of Computing, pp. 733-744 (1992)
-
(1992)
Proc. 24th ACM Symp. on Theory of Computing
, pp. 733-744
-
-
Feige, U.1
-
6
-
-
0026376346
-
Amortized communication complexity
-
Feder, T., Kushilevitz, E., Naor, M., Nisan, N.: Amortized communication complexity. SIAM Journal of Computing, 239-248 (1995)
-
(1995)
SIAM Journal of Computing
, vol.239-248
-
-
Feder, T.1
Kushilevitz, E.2
Naor, M.3
Nisan, N.4
-
7
-
-
43349090255
-
Parallel repetition: Simplifications and the no-signaling case
-
to appear
-
Holenstein, T.: Parallel repetition: simplifications and the no-signaling case. In: Proc. of 39th STOC (to appear, 2007)
-
(2007)
Proc. of 39th STOC
-
-
Holenstein, T.1
-
9
-
-
0030671785
-
Direct Product Results and the GCD Problem, in Old and New Communication Models
-
Parnafes, I., Raz, I.,Wigderson, A.: Direct Product Results and the GCD Problem, in Old and New Communication Models. In: Proc. of the 29th STOC, pp. 363-372 (1997)
-
(1997)
Proc. of the 29th STOC
, pp. 363-372
-
-
Parnafes, I.1
Raz, I.2
Wigderson, A.3
-
10
-
-
0001226672
-
A Parallel Repetition Theorem
-
Raz, R.: A Parallel Repetition Theorem. Siam Journal of Computing 27(3), 763-803 (1998)
-
(1998)
Siam Journal of Computing
, vol.27
, Issue.3
, pp. 763-803
-
-
Raz, R.1
|