乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:04:21Z","timestamp":1740096261301,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385353"},{"type":"electronic","value":"9783642385360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38536-0_16","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T01:03:04Z","timestamp":1370221384000},"page":"183-194","source":"Crossref","is-referenced-by-count":4,"title":["Information Lower Bounds via Self-reducibility"],"prefix":"10.1007","author":[{"given":"Mark","family":"Braverman","sequence":"first","affiliation":[]},{"given":"Ankit","family":"Garg","sequence":"additional","affiliation":[]},{"given":"Denis","family":"Pankratov","sequence":"additional","affiliation":[]},{"given":"Omri","family":"Weinstein","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Ada, A., Chattopadhyay, A., Cook, S., Fontes, L., Koucky, M., Pitassi, T.: The hardness of being private. In: 2012 IEEE 27th Annual Conference on Computational Complexity (CCC), pp. 192\u2013202. IEEE (2012)","DOI":"10.1109\/CCC.2012.24"},{"issue":"4","key":"16_CR2","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1016\/j.jcss.2003.11.006","volume":"68","author":"Z. Bar-Yossef","year":"2004","unstructured":"Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. Journal of Computer and System Sciences\u00a068(4), 702\u2013732 (2004), http:\/\/dx.doi.org\/10.1016\/j.jcss.2003.11.006","journal-title":"Journal of Computer and System Sciences"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Braverman, M., Chen, X., Rao, A.: How to compress interactive communication. In: STOC, pp. 67\u201376 (2010)","DOI":"10.1145\/1806689.1806701"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Braverman, M.: Interactive information complexity. In: STOC, pp. 505\u2013524 (2012)","DOI":"10.1145\/2213977.2214025"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Braverman, M., Garg, A., Pankratov, D., Weinstein, O.: From information to exact communication. Electronic Colloquium on Computational Complexity (ECCC)\u00a019(171) (2012)","DOI":"10.1145\/2488608.2488628"},{"key":"16_CR6","first-page":"177","volume":"19","author":"M. Braverman","year":"2012","unstructured":"Braverman, M., Garg, A., Pankratov, D., Weinstein, O.: Information lower bounds via self-reducibility. Electronic Colloquium on Computational Complexity (ECCC)\u00a019, 177 (2012)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"16_CR7","first-page":"131","volume":"19","author":"M. Braverman","year":"2012","unstructured":"Braverman, M., Moitra, A.: An information complexity approach to extended formulations. Electronic Colloquium on Computational Complexity (ECCC)\u00a019, 131 (2012)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Braverman, M., Rao, A.: Information equals amortized communication. CoRR abs\/1106.3595 (2010)","DOI":"10.1109\/FOCS.2011.86"},{"key":"16_CR9","first-page":"164","volume":"18","author":"M. Braverman","year":"2011","unstructured":"Braverman, M., Weinstein, O.: A discrepancy lower bound for information complexity. Electronic Colloquium on Computational Complexity (ECCC)\u00a018, 164 (2011)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., Kondapally, R., Wang, Z.: Information complexity versus corruption and applications to orthogonality and gap-hamming. CoRR abs\/1205.0968 (2012)","DOI":"10.1007\/978-3-642-32512-0_41"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., Regev, O.: An optimal lower bound on the communication complexity of gap-hamming-distance. In: STOC, pp. 51\u201360 (2011)","DOI":"10.1145\/1993636.1993644"},{"key":"16_CR12","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1109\/SFCS.2001.959901","volume-title":"Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science","author":"A. Chakrabarti","year":"2001","unstructured":"Chakrabarti, A., Shi, Y., Wirth, A., Yao, A.: Informational complexity and the direct sum problem for simultaneous message complexity. In: Werner, B. (ed.) Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, October 14-17, pp. 270\u2013278. IEEE Computer Society, Los Alamitos (2001)"},{"issue":"2","key":"16_CR13","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0217015","volume":"17","author":"B. Chor","year":"1988","unstructured":"Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM Journal on Computing\u00a017(2), 230\u2013261 (1988)","journal-title":"SIAM Journal on Computing"},{"issue":"9","key":"16_CR14","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D. Huffman","year":"1952","unstructured":"Huffman, D.: A method for the construction of minimum-redundancy codes. Proceedings of the IRE\u00a040(9), 1098\u20131101 (1952)","journal-title":"Proceedings of the IRE"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Kerenidis, I., Laplante, S., Lerays, V., Roland, J., Xiao, D.: Lower bounds on information complexity via zero-communication protocols and applications. CoRR abs\/1204.1505 (2012)","DOI":"10.1109\/FOCS.2012.68"},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00224-003-1113-7","volume":"37","author":"H. Klauck","year":"2004","unstructured":"Klauck, H.: Quantum and approximate privacy. Theory Comput. Syst.\u00a037(1), 221\u2013246 (2004)","journal-title":"Theory Comput. Syst."},{"key":"16_CR17","volume-title":"Communication complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press, Cambridge (1997)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"McGregor, A., Mironov, I., Pitassi, T., Reingold, O., Talwar, K., Vadhan, S.: The limits of two-party differential privacy. In: 51st Annual Symposium on Foundations of Computer Science (FOCS), pp. 81\u201390 (2010)","DOI":"10.1109\/FOCS.2010.14"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal 27 (1948), monograph B-1598","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Some complexity questions related to distributive computing (preliminary report). In: STOC, pp. 209\u2013213 (1979)","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38536-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,2]],"date-time":"2023-07-02T03:52:32Z","timestamp":1688269952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38536-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385353","9783642385360"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38536-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}