{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:16:00Z","timestamp":1742912160047,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705741"},{"type":"electronic","value":"9783540705758"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_55","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"674-685","source":"Crossref","is-referenced-by-count":0,"title":["Product Theorems Via Semidefinite Programming"],"prefix":"10.1007","author":[{"given":"Troy","family":"Lee","sequence":"first","affiliation":[]},{"given":"Rajat","family":"Mittal","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"55_CR1","first-page":"230","volume-title":"Proceedings of the 44th IEEE Symposium on Foundations of Computer Science","author":"A. Ambainis","year":"2003","unstructured":"Ambainis, A.: Polynomial degree vs. quantum query complexity. In: Proceedings of the 44th IEEE Symposium on Foundations of Computer Science, pp. 230\u2013239. IEEE, Los Alamitos (2003)"},{"key":"55_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01200056","volume":"1","author":"L. Babai","year":"1991","unstructured":"Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity\u00a01, 3\u201340 (1991)","journal-title":"Computational Complexity"},{"key":"55_CR3","volume-title":"Convex optimization","author":"S. Boyd","year":"2006","unstructured":"Boyd, S., Vandenberghe, L.: Convex optimization. Cambridge University Press, Cambridge (2006)"},{"key":"55_CR4","volume-title":"Proceedings of the 22nd IEEE Conference on Computational Complexity","author":"R. Cleve","year":"2007","unstructured":"Cleve, R., Slofstra, W., Unger, F., Upadhyay, S.: Perfect parallel repetition theorem for quantum XOR proof systems. In: Proceedings of the 22nd IEEE Conference on Computational Complexity. IEEE, Los Alamitos (2007)"},{"key":"55_CR5","first-page":"733","volume-title":"Proceedings of the 24th ACM Symposium on the Theory of Computing","author":"U. Feige","year":"1992","unstructured":"Feige, U., Lov\u00e1sz, L.: Two-prover one-round proof systems: their power and their problems. In: Proceedings of the 24th ACM Symposium on the Theory of Computing, pp. 733\u2013744. ACM, New York (1992)"},{"key":"55_CR6","volume-title":"Proceedings of the 39th ACM Symposium on the Theory of Computing","author":"P. H\u00f8yer","year":"2007","unstructured":"H\u00f8yer, P., Lee, T., \u0160palek, R.: Negative weights make adversaries stronger. In: Proceedings of the 39th ACM Symposium on the Theory of Computing. ACM, New York (2007)"},{"key":"55_CR7","doi-asserted-by":"crossref","unstructured":"Holenstein, T.: Parallel repetition theorem: simplifications and the no-signaling case. In: Proceedings of the 39th ACM Symposium on the Theory of Computing, pp. 411\u2013419 (2007)","DOI":"10.1145\/1250790.1250852"},{"issue":"1","key":"55_CR8","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1137\/S0895480192238482","volume":"8","author":"M. Karchmer","year":"1995","unstructured":"Karchmer, M., Kushilevitz, E., Nisan, N.: Fractional covers and communication complexity. SIAM Journal on Discrete Mathematics\u00a08(1), 76\u201392 (1995)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"55_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"55_CR10","unstructured":"Kempe, J., Regev, O., Toner, B.: The unique game conjecture with entangled provers is false. Technical Report 0712.4279, arXiv (2007)"},{"key":"55_CR11","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Mathematics\u00a013, 383\u2013390 (1975)","journal-title":"Discrete Mathematics"},{"key":"55_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIT.1979.1055985","volume":"IT-25","author":"L. Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: On the Shannon capacity of a graph. IEEE Transactions on Information Theory\u00a0IT-25, 1\u20137 (1979)","journal-title":"IEEE Transactions on Information Theory"},{"key":"55_CR13","volume-title":"Proceedings of the 23rd IEEE Conference on Computational Complexity","author":"N. Linial","year":"2008","unstructured":"Linial, N., Shraibman, A.: Learning complexity versus communication complexity. In: Proceedings of the 23rd IEEE Conference on Computational Complexity. IEEE, Los Alamitos (2008)"},{"key":"55_CR14","volume-title":"Proceedings of the 23rd IEEE Conference on Computational Complexity","author":"T. Lee","year":"2008","unstructured":"Lee, T., Shraibman, A., \u0160palek, R.: A direct product theorem for discrepancy. In: Proceedings of the 23rd IEEE Conference on Computational Complexity. IEEE, Los Alamitos (2008)"},{"key":"55_CR15","unstructured":"Mittal, R., Szegedy, M.: Product rules in semidefinite programming. In: 16th International Symposium on Fundamentals of Computation Theory (2007)"},{"issue":"3","key":"55_CR16","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 on Computing\u00a027(3), 763\u2013803 (1998)","journal-title":"SIAM Journal on Computing"},{"issue":"1\u20132","key":"55_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-003-0175-x","volume":"12","author":"R. Shaltiel","year":"2003","unstructured":"Shaltiel, R.: Towards proving strong direct product theorems. Computational Complexity\u00a012(1\u20132), 1\u201322 (2003)","journal-title":"Computational Complexity"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:30:17Z","timestamp":1714620617000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}