{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T12:25:34Z","timestamp":1749644734821},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":[[1996,7]]},"DOI":"10.1016\/0020-0190(96)00080-4","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"29-30","source":"Crossref","is-referenced-by-count":2,"title":["On the number of ANDs versus the number of ORs in monotone Boolean circuits"],"prefix":"10.1016","volume":"59","author":[{"given":"Uri","family":"Zwick","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(96)00080-4_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(96)00080-4_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579196","article-title":"The monotone circuit complexity of Boolean functions","volume":"7","author":"Alon","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(96)00080-4_BIB3_1","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(96)00080-4_BIB3_2","first-page":"1209","volume":"11","author":"Arlazarov","year":"1970","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0020-0190(96)00080-4_BIB4","article-title":"The complexity of monotone Boolean functions and an algorithm for finding shortest paths in a graph","author":"Bloniarz","year":"1979"},{"key":"10.1016\/0020-0190(96)00080-4_BIB5","series-title":"The Complexity of Boolean Networks","author":"Dunne","year":"1988"},{"key":"10.1016\/0020-0190(96)00080-4_BIB6","first-page":"1171","article-title":"O ventilnykh i kontaktno-ventilnykh skhemakh","volume":"111","author":"Lupanov","year":"1956","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/0020-0190(96)00080-4_BIB7","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1137\/0203011","article-title":"An algorithm for the computation of linear forms","volume":"3","author":"Savage","year":"1974","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(96)00080-4_BIB8","series-title":"The Complexity of Boolean Functions","author":"Wegener","year":"1987"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000804?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019096000804?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:24:06Z","timestamp":1556043846000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019096000804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0020019096000804"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(96)00080-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}