{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:44:19Z","timestamp":1758271459648,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439470"},{"type":"electronic","value":"9783662439487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43948-7_43","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T16:10:36Z","timestamp":1402503036000},"page":"514-524","source":"Crossref","is-referenced-by-count":9,"title":["En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations"],"prefix":"10.1007","author":[{"given":"Dmitry","family":"Gavinsky","sequence":"first","affiliation":[]},{"given":"Shachar","family":"Lovett","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Lovett, S., Ron-Zewi, N.: An Additive Combinatorics Approach Relating Rank to Communication Complexity. In: Proceedings of the 53rd Annual Symposium on Foundations of Computer Science, pp. 177\u2013186 (2012)","DOI":"10.1109\/FOCS.2012.39"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"Jain, R., Klauck, H.: The Partition Bound for Classical Communication Complexity and Query Complexity. In: Proceedings of the 25th IEEE Conference on Computational Complexity, pp. 247\u2013258 (2010)","DOI":"10.1109\/CCC.2010.31"},{"key":"43_CR3","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. In: Proceedings of the 53rd Annual Symposium on Foundations of Computer Science, pp. 500\u2013509 (2012)","DOI":"10.1109\/FOCS.2012.68"},{"issue":"1","key":"43_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/(SICI)1097-0118(199709)26:1<1::AID-JGT1>3.0.CO;2-N","volume":"26","author":"A. Kotlov","year":"1997","unstructured":"Kotlov, A.: Rank and Chromatic Number of a Graph. Journal of Graph Theory\u00a026(1), 1\u20138 (1997)","journal-title":"Journal of Graph Theory"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574948"},{"issue":"4","key":"43_CR6","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s00493-007-2160-5","volume":"27","author":"N. Linial","year":"2007","unstructured":"Linial, N., Mendelson, S., Schechtman, G., Schraibman, A.: Complexity Measures of Sign Matrices. Combinatorica\u00a027(4), 439\u2013463 (2007)","journal-title":"Combinatorica"},{"issue":"1-2","key":"43_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1017\/S0963548308009656","volume":"18","author":"N. Linial","year":"2009","unstructured":"Linial, N., Schraibman, A.: Learning Complexity vs. Communication Complexity. Combinatorics, Probability & Computing\u00a018(1-2), 227\u2013245 (2009)","journal-title":"Combinatorics, Probability & Computing"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Saks, M.: Lattices, M\u00f6bius Functions and Communication Complexity. In: Annual Symposium on Foundations of Computer Science, pp. 81\u201390 (1988)","DOI":"10.1109\/SFCS.1988.21924"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Lovett, S.: Communication is Bounded by Root of Rank. In: Proceedings of the 46th Symposium on Theory of Computing (2014)","DOI":"10.1145\/2591796.2591799"},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Nisan, N., Wigderson, A.: On Rank vs. Communication Complexity. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 831\u2013836 (1994)","DOI":"10.1109\/SFCS.1994.365711"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43948-7_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:31:07Z","timestamp":1746264667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43948-7_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439470","9783662439487"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43948-7_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}