{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T09:19:16Z","timestamp":1790500756935,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642139611","type":"print"},{"value":"9783642139628","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13962-8_27","type":"book-chapter","created":{"date-parts":[[2010,6,26]],"date-time":"2010-06-26T12:33:57Z","timestamp":1277555637000},"page":"239-245","source":"Crossref","is-referenced-by-count":8,"title":["Circuit Complexity and Multiplicative Complexity of Boolean Functions"],"prefix":"10.1007","author":[{"given":"Arist","family":"Kojevnikov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander S.","family":"Kulikov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/j.1538-7305.1949.tb03624.x","volume":"28","author":"C.E. Shannon","year":"1949","unstructured":"Shannon, C.E.: The synthesis of two-terminal switching circuits. Bell System Technical Journal\u00a028, 59\u201398 (1949)","journal-title":"Bell System Technical Journal"},{"key":"27_CR2","doi-asserted-by":"publisher","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\u00a013, 155\u2013171 (1974)","journal-title":"Computing"},{"issue":"3","key":"27_CR3","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1137\/0206030","volume":"6","author":"W.J. Paul","year":"1977","unstructured":"Paul, W.J.: A 2.5n-lower bound on the combinational complexity of Boolean functions. SIAM Journal of Computing\u00a06(3), 427\u2013433 (1977)","journal-title":"SIAM Journal of Computing"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/BF01683282","volume":"10","author":"L.J. Stockmeyer","year":"1977","unstructured":"Stockmeyer, L.J.: On the combinational complexity of certain symmetric Boolean functions. Mathematical Systems Theory\u00a010, 323\u2013336 (1977)","journal-title":"Mathematical Systems Theory"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/3-540-45687-2_29","volume-title":"Mathematical Foundations of Computer Science 2002","author":"K. Iwama","year":"2002","unstructured":"Iwama, K., Morizumi, H.: An explicit lower bound of 5n\u2009\u2212\u2009o(n) for boolean circuits. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 353\u2013364. Springer, Heidelberg (2002)"},{"issue":"1","key":"27_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(99)00182-6","volume":"235","author":"J. Boyar","year":"2000","unstructured":"Boyar, J., Peralta, R., Pochuev, D.: On The Multiplicative Complexity of Boolean Functions over the Basis \n                  \n                    \n                  \n                  $(\\land,\\oplus,1)$\n                . Theoretical Computer Science\u00a0235(1), 1\u201316 (2000)","journal-title":"Theoretical Computer Science"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/3-540-51083-4_47","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"C.P. Schnorr","year":"1989","unstructured":"Schnorr, C.P.: The Multiplicative Complexity of Boolean Functions. In: Mora, T. (ed.) AAECC 1988. LNCS, vol.\u00a0357, pp. 45\u201358. Springer, Heidelberg (1989)"},{"key":"27_CR8","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0304-3975(83)90029-4","volume":"28","author":"N. Blum","year":"1984","unstructured":"Blum, N.: A Boolean function requiring 3n network size. Theoretical Computer Science\u00a0(28), 337\u2013345 (1984)","journal-title":"Theoretical Computer Science"},{"issue":"7","key":"27_CR9","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1016\/j.ipl.2010.01.007","volume":"110","author":"E. Demenkov","year":"2010","unstructured":"Demenkov, E., Kojevnikov, A., Kulikov, A.S., Yaroslavtsev, G.: New upper bounds on the Boolean circuit complexity of symmetric functions. Information Processing Letters\u00a0110(7), 264\u2013267 (2010)","journal-title":"Information Processing Letters"},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/0220032","volume":"20","author":"U. Zwick","year":"1991","unstructured":"Zwick, U.: A 4n lower bound on the combinational complexity of certain symmetric boolean functions over the basis of unate dyadic Boolean functions. SIAM Journal on Computing\u00a020, 499\u2013505 (1991)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Programs, Proofs, Processes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13962-8_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:16:50Z","timestamp":1619785010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13962-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642139611","9783642139628"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13962-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}