{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:57:51Z","timestamp":1775282271444,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1007\/bf01192528","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T12:09:11Z","timestamp":1108728551000},"page":"567-588","source":"Crossref","is-referenced-by-count":29,"title":["On the ?log rank?-conjecture in communication complexity"],"prefix":"10.1007","volume":"15","author":[{"given":"Ran","family":"Raz","sequence":"first","affiliation":[]},{"given":"Boris","family":"Spieker","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1002\/jgt.3190130413","volume":"13","author":"N. Alon","year":"1989","unstructured":"N. Alon, andP. D. Seymour: A counterexample to the rank-coloring conjecture,J. Graph Theory 13 (1989), 523?525.","journal-title":"J. Graph Theory"},{"key":"CR2","unstructured":"Hermann Boernner:Representation of Groups, North Holland, 1970."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1090\/S0002-9939-1975-0354422-3","volume":"47","author":"T. A. Dowling","year":"1975","unstructured":"T. A. Dowling andR. M. Wilson: Whitney number inequalitics for geometric lattices,Proc. Amer. Math. Soc.,47 (1975), 504?512.","journal-title":"Proc. Amer. Math. Soc."},{"key":"CR4","unstructured":"W. Fulton, andJ. Harris:Representation Theory, Springer-Verlag, 1991."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"A. Hajnal, W. Maass, andG. Turan: On the Communication Complexity of graph Properties,Proc. 20th ACM STOC 1988, 186?191.","DOI":"10.1145\/62212.62228"},{"key":"CR6","unstructured":"L. Lov\ufffdsz: Communication Complexity: A Survey, in:Paths, Flows and VLSIlayout, Springer-Verlag 1990, 235?266."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/0022-0000(93)90035-U","volume":"47","author":"L. Lov\ufffdsz","year":"1993","unstructured":"L. Lov\ufffdsz. andM. Saks: Communication Complexity and Combinatorial Lattice Theory,Journal of Computer and System Sciences,47 (1993), 322?349.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn, andE. M. Schmidt: Las Vegas is Better than Determinism in VLSI and Distributed Computing,Proc. 14th ACM STOC 1982, 330?337.","DOI":"10.1145\/800070.802208"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"N. Nisan, andA. Wigderson: On Rank vs. Communication Complexity,Proc. 35th IEEE FOCS 1994 831?836;Combinatorica,15(4) (1995), 557?565.","DOI":"10.1007\/BF01192527"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0012-365X(92)90691-8","volume":"108","author":"A. Razborov","year":"1992","unstructured":"A. Razborov: The Gap between the Chromatic Number of a Graph and the Rank of its Adjacency Matrix is Superlinear,Discrete Mathematics,108 (1992), 393?396.","journal-title":"Discrete Mathematics"},{"key":"CR11","unstructured":"Bruce E. Sagan:The Symmetric Group, Brooks & Cole, 1991."},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Andrew C. Yao: Some Complexity Questions Related to Distributive Computing,Proc. 11th ACM STOC 1979, 209?213.","DOI":"10.1145\/800135.804414"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01192528.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01192528\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01192528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T12:19:41Z","timestamp":1734956381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01192528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["BF01192528"],"URL":"https:\/\/doi.org\/10.1007\/bf01192528","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}