-
1
-
-
4544250512
-
Expander Flows, Geometric Embeddings and Graph Partitioning
-
Arora, S., Rao, S., Vazirani, U.: Expander Flows, Geometric Embeddings and Graph Partitioning. In: Proceedings of Symposium on the Theory of Computing (2004)
-
(2004)
Proceedings of Symposium on the Theory of Computing
-
-
Arora, S.1
Rao, S.2
Vazirani, U.3
-
2
-
-
0043016194
-
Quantum query complexity and semi-definite programming
-
Barnum, H., Saks, M.E., Szegedy, M.: Quantum query complexity and semi-definite programming. In: IEEE Conference on Computational Complexity, pp. 179-193 (2003)
-
(2003)
IEEE Conference on Computational Complexity
, pp. 179-193
-
-
Barnum, H.1
Saks, M.E.2
Szegedy, M.3
-
3
-
-
4944260870
-
Consequences and Limits of Nonlocal Strategies
-
Cleve, R., Hoyer, P., Toner, B., Watrous, J.: Consequences and Limits of Nonlocal Strategies. In: IEEE Conference on Computational Complexity, pp. 236-249 (2004)
-
(2004)
IEEE Conference on Computational Complexity
, pp. 236-249
-
-
Cleve, R.1
Hoyer, P.2
Toner, B.3
Watrous, J.4
-
4
-
-
34848876210
-
-
August
-
Cleve, R., Slofstra, W., Unger, F., Upadhyay, S.: Strong parallel repetition Theorem for Quantum XOR Proof Systems: quant-ph (August 2006)
-
(2006)
Strong parallel repetition Theorem for Quantum XOR Proof Systems: Quant-ph
-
-
Cleve, R.1
Slofstra, W.2
Unger, F.3
Upadhyay, S.4
-
5
-
-
0034827606
-
Approximation Algorithms for MAX-3-CUT and Other Problems Via Complex Semidefinite Programming. Journal of Computer and System Sciences (Special Issue for STOC 2001), 68
-
Crete
-
Goemans, M.X., Williamson, D.P.: Approximation Algorithms for MAX-3-CUT and Other Problems Via Complex Semidefinite Programming. Journal of Computer and System Sciences (Special Issue for STOC 2001), 68, 442-470 (2004) (Preliminary version in Proceedings of 33rd STOC, Crete, 443-452 (2001))
-
(2001)
442-470 (2004) (Preliminary version in Proceedings of 33rd STOC
, pp. 443-452
-
-
Goemans, M.X.1
Williamson, D.P.2
-
6
-
-
35449006633
-
Negative weights makes adversaries stronger
-
quant-ph/0611054
-
Hoyer, P., Lee, T., Spalek, R.: Negative weights makes adversaries stronger, quant-ph/0611054
-
-
-
Hoyer, P.1
Lee, T.2
Spalek, R.3
-
7
-
-
33745312939
-
The Quantum Adversary Method and Classical Formula Size Lower Bounds
-
Laplante, S., Lee, T., Szegedy, M.: The Quantum Adversary Method and Classical Formula Size Lower Bounds. Computational Complexity 15(2), 163-196 (2006)
-
(2006)
Computational Complexity
, vol.15
, Issue.2
, pp. 163-196
-
-
Laplante, S.1
Lee, T.2
Szegedy, M.3
-
8
-
-
0032028848
-
Approximate Graph Coloring by Semidefinite Programming
-
Karger, D.R., Motwani, R., Sudan, M.: Approximate Graph Coloring by Semidefinite Programming. J. ACM 45(2), 246-265 (1998)
-
(1998)
J. ACM
, vol.45
, Issue.2
, pp. 246-265
-
-
Karger, D.R.1
Motwani, R.2
Sudan, M.3
-
12
-
-
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
-
13
-
-
38149001254
-
-
Szegedy, M.: A note on the theta number of Lovász and the generalized Delsarte bound. In: FOCS (1994)
-
Szegedy, M.: A note on the theta number of Lovász and the generalized Delsarte bound. In: FOCS (1994)
-
-
-
-
14
-
-
0003054911
-
Quantum analogues of the Bell inequalities: The case of two spatially separated domains
-
Tsirelson, B.S.: Quantum analogues of the Bell inequalities: The case of two spatially separated domains. Journal of Soviet Mathematics 36, 557-570 (1987)
-
(1987)
Journal of Soviet Mathematics
, vol.36
, pp. 557-570
-
-
Tsirelson, B.S.1
|