{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,26]],"date-time":"2023-12-26T19:27:17Z","timestamp":1703618837685},"reference-count":17,"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":[[1991,6]]},"DOI":"10.1137\/0220032","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:34:57Z","timestamp":1109226897000},"page":"499-505","source":"Crossref","is-referenced-by-count":24,"title":["A $4n$ Lower Bound on the Combinational Complexity of Certain Symmetric Boolean Functions over the Basis of Unate Dyadic Boolean Functions"],"prefix":"10.1137","volume":"20","author":[{"given":"Uri","family":"Zwick","sequence":"first","affiliation":[]}],"member":"351","reference":[{"key":"RA","first-page":"1033","volume":"282","author":"Andreev A. E.","year":"1985","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"RAB","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579196"},{"key":"RB","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90029-4"},{"key":"RBS","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-88071-0.50019-9"},{"key":"RD","volume-title":"The complexity of Boolean networks","author":"Dunne Paul E.","year":"1988"},{"key":"RHHS","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90018-3"},{"key":"RKM","first-page":"44","volume":"4","author":"Kloss B. M.","year":"1965","journal-title":"Vestnik Moskov. Univ. Ser. Mat. Mekh."},{"key":"RLM","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676878"},{"key":"RP","doi-asserted-by":"publisher","DOI":"10.1137\/0206030"},{"key":"RRA","first-page":"798","volume":"281","author":"Razborov A. A.","year":"1985","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"RRE","author":"Red'kin N. P.","year":"1970","journal-title":"Problemy Kibernet."},{"key":"RSC-1","first-page":"155","volume":"13","author":"Schnorr C. P.","year":"1974","journal-title":"Computing (Arch. Elektron. Rechnen)"},{"key":"RSC-2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90073-6"},{"key":"RSH","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb03624.x"},{"key":"RSO","first-page":"117","volume":"15","author":"Soprunenko E. P.","year":"1965","journal-title":"Problemy Kibernet. No."},{"key":"RST","doi-asserted-by":"publisher","DOI":"10.1007\/BF01683282"},{"key":"RW","volume-title":"The complexity of Boolean functions","author":"Wegener Ingo","year":"1987"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0220032","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,29]],"date-time":"2017-01-29T12:27:07Z","timestamp":1485692827000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/0220032"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["10.1137\/0220032"],"URL":"https:\/\/doi.org\/10.1137\/0220032","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}