{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T18:34:13Z","timestamp":1648751653146},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1988,7,1]],"date-time":"1988-07-01T00:00:00Z","timestamp":583718400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1988,7]]},"DOI":"10.1016\/0020-0190(88)90207-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"189-192","source":"Crossref","is-referenced-by-count":1,"title":["Matrix multiplication for finite algebraic systems"],"prefix":"10.1016","volume":"28","author":[{"given":"Daniel J.","family":"Rosenkrantz","sequence":"first","affiliation":[]},{"suffix":"III","given":"Harry B.","family":"Hunt","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(88)90207-4_BIB1_1","first-page":"195","article-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(88)90207-4_BIB1_2","first-page":"201","article-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(88)90207-4_BIB1_3","first-page":"242","article-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(88)90207-4_BIB2","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/SWAT.1971.4","article-title":"Boolean matrix multiplication and transitive closure","author":"Fischer","year":"1971","journal-title":"Conf. Rec. IEEE 12th Ann. Symp. on Switching and Automata Theory"},{"issue":"12","key":"10.1016\/0020-0190(88)90207-4_BIB3","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1145\/7902.7903","article-title":"Data parallel algorithms","volume":"29","author":"Hillis","year":"1986","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(88)90207-4_BIB4","article-title":"How to multiply matrices faster","volume":"Vol. 129","author":"Pan","year":"1984"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088902074?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088902074?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:21:36Z","timestamp":1555089696000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019088902074"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,7]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1988,7]]}},"alternative-id":["0020019088902074"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(88)90207-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1988,7]]}}}