{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,26]],"date-time":"2023-12-26T19:27:55Z","timestamp":1703618875598},"reference-count":15,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1977,9]]},"DOI":"10.1137\/0206030","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T05:59:55Z","timestamp":1109224795000},"page":"427-443","source":"Crossref","is-referenced-by-count":44,"title":["A $2.5n$-Lower Bound on the Combinational Complexity of Boolean Functions"],"prefix":"10.1137","volume":"6","author":[{"given":"Wolfgang J.","family":"Paul","sequence":"first","affiliation":[]}],"member":"351","reference":[{"key":"R3","unstructured":"G\u00fcnter Hotz  , Schaltkreistheorie, Walter de Gruyter, Berlin-New York, 1974, 336\u2013MR0363693 (50:16130)0296.94015"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"R5","first-page":"35","volume":"9","author":"Hrapcenko V. M.","year":"1971","journal-title":"Mat. Zametki"},{"key":"R6","volume":"3","author":"Lupanov O. B.","year":"1957","journal-title":"Probleme der Kybernetik"},{"key":"R7","volume-title":"Mathematical foundations of computer science 1975 (Fourth Sympos., Mari\u00e1nsk\u00e9 L\u00e1zn e, 1975)","author":"Mehlhorn Kurt","year":"1975"},{"key":"R8","volume-title":"6.853 Lecture notes","author":"Meyer A.","year":"1974"},{"key":"R9","first-page":"999","volume":"7","author":"Neciporuk E. I.","year":"1966","journal-title":"Soviet Math. Probl."},{"key":"R13","volume-title":"The complexity of computing","author":"Savage John E.","year":"1976"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1145\/321724.321731"},{"key":"R16","volume":"28","author":"Shannon C. E.","year":"1949","journal-title":"Bell System Tech. J."},{"key":"R17","first-page":"153","volume-title":"Mathematical foundations of computer science (Proc. Sympos. and Summer School, Strbsk\u00e9 Pleso, 1973)","author":"Schnorr C.-P.","year":"1973"},{"key":"R18","first-page":"155","volume":"13","author":"Schnorr C. P.","year":"1974","journal-title":"Computing (Arch. Elektron. Rechnen)"},{"key":"R19","volume-title":"The combinational complexity of equivalence, $GI$-Fachtagung Automatentheorie und Formale Sprachen, Kaiserslautern","author":"Schnorr C. P.","year":"1974"},{"key":"R20","volume-title":"The complexity of decision problems in Automata theory and Logic","author":"Stockmeyer L. J.","year":"1974"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289512"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0206030","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,29]],"date-time":"2017-01-29T12:16:11Z","timestamp":1485692171000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/0206030"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,9]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1977,9]]}},"alternative-id":["10.1137\/0206030"],"URL":"https:\/\/doi.org\/10.1137\/0206030","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,9]]}}}