乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T12:07:29Z","timestamp":1709813249923},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,9,24]],"date-time":"2015-09-24T00:00:00Z","timestamp":1443052800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s00224-015-9655-z","type":"journal-article","created":{"date-parts":[[2015,9,24]],"date-time":"2015-09-24T06:23:15Z","timestamp":1443075795000},"page":"377-396","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Information Lower Bounds via Self-Reducibility"],"prefix":"10.1007","volume":"59","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","published-online":{"date-parts":[[2015,9,24]]},"reference":[{"key":"9655_CR1","doi-asserted-by":"crossref","unstructured":"Ada, A., Chattopadhyay, A., Cook, S., Fontes, L., Koucky, M., Pitassi, T.: The hardness of being private. In: CCC, pp. 192\u2013202. IEEE (2012)","DOI":"10.1109\/CCC.2012.24"},{"key":"9655_CR2","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method. Wiley (1992)"},{"issue":"4","key":"9655_CR3","doi-asserted-by":"crossref","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. J. Comput. Syst. Sci. 68(4), 702\u2013732 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"9655_CR4","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":"9655_CR5","doi-asserted-by":"crossref","unstructured":"Braverman, M.: Interactive information complexity. In: STOC, pp 505\u2013524 (2012)","DOI":"10.1145\/2213977.2214025"},{"key":"9655_CR6","doi-asserted-by":"crossref","unstructured":"Braverman, M., Garg, A., Pankratov, D., Weinstein, O.: From information to exact communication. Electronic Colloquium on Computational Complexity (ECCC) 19(171) (2012)","DOI":"10.1145\/2488608.2488628"},{"key":"9655_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) 19, 131 (2012)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"9655_CR8","doi-asserted-by":"crossref","unstructured":"Braverman, M., Rao, A.: Information equals amortized communication. arXiv: 1106.3595 (2010)","DOI":"10.1109\/FOCS.2011.86"},{"key":"9655_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) 18, 164 (2011)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"9655_CR10","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., Kondapally, R., Wang, Z.: Information complexity versus corruption and applications to orthogonality and gap-hamming. arXiv: 1205.0968 (2012)","DOI":"10.1007\/978-3-642-32512-0_41"},{"key":"9655_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":"9655_CR12","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., Shi, Y., Wirth, A., Yao, A.: Informational complexity and the direct sum problem for simultaneous message complexity. In: FOCS, pp. 270\u2013278 (2001)","DOI":"10.1109\/SFCS.2001.959901"},{"issue":"2","key":"9655_CR13","doi-asserted-by":"crossref","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 J. Comput. 17(2), 230\u2013261 (1988)","journal-title":"SIAM J. Comput."},{"key":"9655_CR14","doi-asserted-by":"crossref","unstructured":"Ganor, A., Kol, G., Raz, R.: Exponential separation of information and communication for boolean functions. In: STOC, pp. 557\u2013566 (2015)","DOI":"10.1145\/2746539.2746572"},{"issue":"9","key":"9655_CR15","doi-asserted-by":"crossref","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. Proc. IRE 40(9), 1098\u20131101 (1952)","journal-title":"Proc. IRE"},{"key":"9655_CR16","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. arXiv: 1204.1505 (2012)","DOI":"10.1109\/FOCS.2012.68"},{"issue":"1","key":"9655_CR17","doi-asserted-by":"crossref","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. 37(1), 221\u2013246 (2004)","journal-title":"Theory Comput. Syst."},{"key":"9655_CR18","doi-asserted-by":"crossref","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":"9655_CR19","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: FOCS, pp. 81\u201390 (2010)","DOI":"10.1109\/FOCS.2010.14"},{"key":"9655_CR20","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":"9655_CR21","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":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9655-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-015-9655-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9655-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,14]],"date-time":"2023-08-14T13:43:58Z","timestamp":1692020638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-015-9655-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,24]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9655"],"URL":"https:\/\/doi.org\/10.1007\/s00224-015-9655-z","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,24]]}}}