{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T08:32:38Z","timestamp":1673080358034},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,9,1]],"date-time":"1988-09-01T00:00:00Z","timestamp":589075200000},"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,9]]},"DOI":"10.1016\/0020-0190(88)90130-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"37-38","source":"Crossref","is-referenced-by-count":10,"title":["A practical algorithm for boolean matrix multiplication"],"prefix":"10.1016","volume":"29","author":[{"given":"Michael D.","family":"Atkinson","sequence":"first","affiliation":[]},{"given":"N.","family":"Santoro","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(88)90130-5_BIB1","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF00264600","article-title":"Improved time and space bounds for Boolean matrix multiplication","volume":"11","author":"Adleman","year":"1978","journal-title":"Acta Informatica"},{"key":"10.1016\/0020-0190(88)90130-5_BIB2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(88)90130-5_BIB3","first-page":"487","article-title":"On economical construction of the transitive closure of a directed graph","volume":"194","author":"Arlazarov","year":"1970","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0020-0190(88)90130-5_BIB4","first-page":"241","article-title":"Four O(N2) multiplication methods for sparse and dense Boolean matrices","volume":"Vol. 31","author":"Santoro","year":"1981"},{"key":"10.1016\/0020-0190(88)90130-5_BIB5","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF02240211","article-title":"An improved algorithm for Boolean matrix multiplication","volume":"36","author":"Santoro","year":"1986","journal-title":"Computing"},{"key":"10.1016\/0020-0190(88)90130-5_BIB6","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0020-0190(84)90061-9","article-title":"A note on Boolean matrix multiplication","volume":"19","author":"Vyskoc","year":"1984","journal-title":"Inform Process Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088901305?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088901305?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:22:02Z","timestamp":1555089722000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019088901305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,9]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,9]]}},"alternative-id":["0020019088901305"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(88)90130-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1988,9]]}}}