메뉴 건너뛰기




Volumn 4639 LNCS, Issue , 2007, Pages 435-445

Product rules in semidefinite programming

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; GRAPH THEORY; INTERACTIVE COMPUTER SYSTEMS; PROBLEM SOLVING; QUANTUM COMPUTERS; THEOREM PROVING;

EID: 38149054793     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74240-1_38     Document Type: Conference Paper
Times cited : (16)

References (14)
  • 5
    • 0034827606 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고
    • 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


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.