{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T19:03:54Z","timestamp":1649012634733},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1986,5,1]],"date-time":"1986-05-01T00:00:00Z","timestamp":515289600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1986,5]]},"DOI":"10.1007\/bf00289499","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T23:55:13Z","timestamp":1096934113000},"page":"217-221","source":"Crossref","is-referenced-by-count":0,"title":["Nearly optimal hierarchies for network and formula size"],"prefix":"10.1007","volume":"23","author":[{"given":"M. S.","family":"Paterson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Wegener","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF00264601","volume":"11","author":"W.F. McColl","year":"1978","unstructured":"McColl, W.F.: Complexity hierarchies for Boolean functions. Acta Inf. 11, 71?77 (1978)","journal-title":"Acta Inf."},{"key":"CR2","first-page":"85","volume":"23","author":"N.P. Red'kin","year":"1973","unstructured":"Red'kin, N.P.: Proof of minimality of circuits consisting of functional elements. Syst. Theo. Res. 23, 85?103 (1973)","journal-title":"Syst. Theo. Res."},{"key":"CR3","volume-title":"The Complexity of Computing","author":"J.E. Savage","year":"1976","unstructured":"Savage, J.E.: The Complexity of Computing. New York: John Wiley 1976"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02246615","volume":"13","author":"C. Schnorr","year":"1974","unstructured":"Schnorr, C.: Zwei lineare untere Schranken f\u00fcr die Komplexit\u00e4t Boolescher Funktionen. Computing 13, 155?171 (1974)","journal-title":"Computing"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF00288962","volume":"15","author":"I. Wegener","year":"1981","unstructured":"Wegener, I.: An improved complexity hierarchy on the depth of Boolean functions. Acta Inf. 15, 147?152 (1981)","journal-title":"Acta Inf."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289499.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289499\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289499","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:14:54Z","timestamp":1554743694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289499"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,5]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,5]]}},"alternative-id":["BF00289499"],"URL":"https:\/\/doi.org\/10.1007\/bf00289499","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,5]]}}}