{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T21:34:09Z","timestamp":1672522449225},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,7,1]],"date-time":"1979-07-01T00:00:00Z","timestamp":299635200000},"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":12435,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1979,7]]},"DOI":"10.1016\/0304-3975(79)90008-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"83-97","source":"Crossref","is-referenced-by-count":17,"title":["Switching functions whose monotone complexity is nearly quadratic"],"prefix":"10.1016","volume":"9","author":[{"given":"Ingo","family":"Wegener","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(79)90008-2_BIB1","first-page":"129","article-title":"Boolean matrix multiplication and transitive closure","author":"Fischer","year":"1971","journal-title":"IEEE Conference Record of the Twelfth Annual Symposium on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(79)90008-2_BIB2","first-page":"99","volume":"16","author":"Mehlhorn","year":"1976","journal-title":"Monotone switching circuits and Boolean matrix product, Computing"},{"key":"10.1016\/0304-3975(79)90008-2_BIB3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0304-3975(75)90009-2","article-title":"Complexity of monotone networks for Boolean matrix product","volume":"1","author":"Paterson","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(79)90008-2_BIB4","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1137\/0204027","article-title":"The power of negative thinking in multiplying Boolean matrices","volume":"4","author":"Pratt","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(79)90008-2_BIB5","series-title":"The Complexity of Computing","author":"Savage","year":"1976"},{"key":"10.1016\/0304-3975(79)90008-2_BIB6","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF02165411","article-title":"Gaussian elimination is not optimal","volume":"13","author":"Strassen","year":"1969","journal-title":"Numer. Math."},{"key":"10.1016\/0304-3975(79)90008-2_BIB7","series-title":"Dissertation","article-title":"Boolesche Funktionen, deren monotone Komplexit\u00e4t fast quadratisch ist","author":"Wegener","year":"1978"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900082?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900082?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:23:39Z","timestamp":1555125819000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397579900082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,7]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,7]]}},"alternative-id":["0304397579900082"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(79)90008-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1979,7]]}}}