{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T05:08:14Z","timestamp":1648789694861},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,10,1]],"date-time":"1983-10-01T00:00:00Z","timestamp":433814400000},"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":[[1983,10]]},"DOI":"10.1016\/0020-0190(83)90051-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"125-128","source":"Crossref","is-referenced-by-count":4,"title":["A measure in which Boolean negation is exponentially powerful"],"prefix":"10.1016","volume":"17","author":[{"given":"Sven","family":"Skyum","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(83)90051-0_BIB1","unstructured":"P.A. Bloniarz, The complexity of monotone Boolean functions and an algorithm for finding shortest paths in a graph, Ph.D. Thesis, MIT\/LCS\/TR-238."},{"key":"10.1016\/0020-0190(83)90051-0_BIB2","first-page":"120","article-title":"Ob odnom methode sinteza skhem","volume":"1","author":"Lupanov","year":"1958","journal-title":"Izv. V.U.Z. Radiofiz"},{"key":"10.1016\/0020-0190(83)90051-0_BIB3","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01768483","article-title":"The complexity of monotone Boolean functions","volume":"11","author":"Pippenger","year":"1978","journal-title":"Math. System Theory"},{"key":"10.1016\/0020-0190(83)90051-0_BIB4","series-title":"The Complexity of Computing","author":"Savage","year":"1974"},{"key":"10.1016\/0020-0190(83)90051-0_BIB5","first-page":"244","article-title":"A complexity theory based on Boolean algebra","author":"Skyum","year":"1981","journal-title":"Proc. 22nd Ann. IEEE FOCS"},{"key":"10.1016\/0020-0190(83)90051-0_BIB6","first-page":"249","article-title":"Completeness classes in algebra","author":"Valiant","year":"1979","journal-title":"Proc. 8th ACM STOC"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900510?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900510?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:56:46Z","timestamp":1555073806000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019083900510"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,10]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,10]]}},"alternative-id":["0020019083900510"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(83)90051-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1983,10]]}}}