{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T08:09:10Z","timestamp":1673078950711},"reference-count":11,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7899,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1016\/0885-064x(91)90027-u","type":"journal-article","created":{"date-parts":[[2004,9,8]],"date-time":"2004-09-08T18:41:18Z","timestamp":1094668878000},"page":"395-407","source":"Crossref","is-referenced-by-count":3,"title":["The communication complexity of several problems in matrix computation"],"prefix":"10.1016","volume":"7","author":[{"given":"Jeff I","family":"Chu","sequence":"first","affiliation":[]},{"given":"Georg","family":"Schnitger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0885-064X(91)90027-U_BIB1","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1145\/322261.322269","article-title":"The chip complexity of binary arithmetic","volume":"28","author":"Brent","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0885-064X(91)90027-U_BIB2","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1145\/3828.3834","article-title":"A model of computation for VLSI with related complexity results","volume":"32","author":"Chazelle","year":"1985","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0885-064X(91)90027-U_BIB3","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1145\/2422.322421","article-title":"Information transfer in distributed computing with applications to VLSI","volume":"31","author":"Ja\u2032ja\u2032","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0885-064X(91)90027-U_BIB11","unstructured":"Leighton, T. (1987), personal communication."},{"key":"10.1016\/0885-064X(91)90027-U_BIB4","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0022-0000(85)90050-9","article-title":"Area-period tradeoffs for multiplication of rectangular matrices","volume":"30","author":"Lin","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0885-064X(91)90027-U_BIB5","series-title":"Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science","first-page":"81","article-title":"Lattices, M\u00f6bius functions and communication complexity","author":"Lovasz","year":"1988"},{"key":"10.1016\/0885-064X(91)90027-U_BIB6","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/0022-0000(81)90029-5","article-title":"Area-time tradeoffs for matrix multiplication and related problems in VLSI models","volume":"22","author":"Savage","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0885-064X(91)90027-U_BIB7","series-title":"Proceedings of the 11th Annual ACM Symposium on Theory of Computing","first-page":"81","article-title":"Area time complexity for VLSI","author":"Thompson","year":"1979"},{"key":"10.1016\/0885-064X(91)90027-U_BIB8","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1109\/TC.1983.1676221","article-title":"A combinatorial limit to the computing power of VLSI circuits","volume":"32","author":"Vuillemin","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0885-064X(91)90027-U_BIB9","series-title":"Proceedings of the 11th Annual ACM Symposium on Theory of Computing","first-page":"209","article-title":"Some complexity questions related to distributive computing","author":"Yao","year":"1979"},{"key":"10.1016\/0885-064X(91)90027-U_BIB10","series-title":"Proceedings of the 13th Annual ACM Symposium on Theory of Computing","first-page":"308","article-title":"The entropic limitations of VLSI computation","author":"Yao","year":"1981"}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X9190027U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0885064X9190027U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T01:57:33Z","timestamp":1549245453000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0885064X9190027U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["0885064X9190027U"],"URL":"https:\/\/doi.org\/10.1016\/0885-064x(91)90027-u","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}