{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:54:55Z","timestamp":1725490495931},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742395"},{"type":"electronic","value":"9783540742401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74240-1_38","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T11:04:18Z","timestamp":1188212658000},"page":"435-445","source":"Crossref","is-referenced-by-count":4,"title":["Product Rules in Semidefinite Programming"],"prefix":"10.1007","author":[{"given":"Rajat","family":"Mittal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Szegedy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Rao, S., Vazirani, U.: Expander Flows, Geometric Embeddings and Graph Partitioning. In: Proceedings of Symposium on the Theory of Computing (2004)","DOI":"10.1145\/1007352.1007355"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"Barnum, H., Saks, M.E., Szegedy, M.: Quantum query complexity and semi-definite programming. In: IEEE Conference on Computational Complexity, pp. 179\u2013193 (2003)","DOI":"10.1109\/CCC.2003.1214419"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Cleve, R., Hoyer, P., Toner, B., Watrous, J.: Consequences and Limits of Nonlocal Strategies. In: IEEE Conference on Computational Complexity, pp. 236\u2013249 (2004)","DOI":"10.1109\/CCC.2004.1313847"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"Cleve, R., Slofstra, W., Unger, F., Upadhyay, S.: Strong parallel repetition Theorem for Quantum XOR Proof Systems, quant-ph (August 2006)","DOI":"10.1109\/CCC.2007.24"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013470, 2004. Preliminary version in Proceedings of 33rd STOC, Crete, pp. 443\u2013452 (2001)","DOI":"10.1016\/j.jcss.2003.07.012"},{"key":"38_CR6","unstructured":"Hoyer, P., Lee, T., Spalek, R.: Negative weights makes adversaries stronger, quant-ph\/06, 4 (1105)"},{"issue":"2","key":"38_CR7","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00037-006-0212-7","volume":"15","author":"S. Laplante","year":"2006","unstructured":"Laplante, S., Lee, T., Szegedy, M.: The Quantum Adversary Method and Classical Formula Size Lower Bounds. Computational Complexity\u00a015(2), 163\u2013196 (2006)","journal-title":"Computational Complexity"},{"issue":"2","key":"38_CR8","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/274787.274791","volume":"45","author":"D.R. Karger","year":"1998","unstructured":"Karger, D.R., Motwani, R., Sudan, M.: Approximate Graph Coloring by Semidefinite Programming. J. ACM\u00a045(2), 246\u2013265 (1998)","journal-title":"J. ACM"},{"key":"38_CR9","unstructured":"Kitaev(unpublished proof). Quantum Coin Tossing. Slides at the archive of MSRI Berkeley"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Knuth, D.E.: The Sandwich Theorem: Electron. J. Combin (1994)","DOI":"10.37236\/1193"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: On the Shannon capacity of a graph. IEEE Transactions on Information Theory (January 1979)","DOI":"10.1109\/TIT.1979.1055985"},{"issue":"3","key":"38_CR12","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1137\/S0097539795280895","volume":"27","author":"R. Raz","year":"1998","unstructured":"Raz, R.: A Parallel Repetition Theorem. SIAM Journal of Computing\u00a027(3), 763\u2013803 (1998)","journal-title":"SIAM Journal of Computing"},{"key":"38_CR13","unstructured":"Szegedy, M.: A note on the theta number of Lov\u00e1sz and the generalized Delsarte bound: FOCS (1994)"},{"key":"38_CR14","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/BF01663472","volume":"36","author":"B.S. Tsirelson","year":"1987","unstructured":"Tsirelson, B.S.: Quantum analogues of the Bell inequalities: The case of two spatially separated domains. Journal of Soviet Mathematics\u00a036, 557\u2013570 (1987)","journal-title":"Journal of Soviet Mathematics"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74240-1_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:20:04Z","timestamp":1605763204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74240-1_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540742395","9783540742401"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74240-1_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}