{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:22:24Z","timestamp":1726410144400},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642306419"},{"type":"electronic","value":"9783642306426"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30642-6_9","type":"book-chapter","created":{"date-parts":[[2012,8,11]],"date-time":"2012-08-11T08:01:39Z","timestamp":1344672099000},"page":"81-88","source":"Crossref","is-referenced-by-count":0,"title":["Computing All MOD-Functions Simultaneously"],"prefix":"10.1007","author":[{"given":"Evgeny","family":"Demenkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander S.","family":"Kulikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Mihajlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroki","family":"Morizumi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_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":"9_CR2","first-page":"120","volume":"1","author":"O. Lupanov","year":"1959","unstructured":"Lupanov, O.: A method of circuit synthesis. Izvestiya VUZov, Radiofizika\u00a01, 120\u2013140 (1959) (in Russian)","journal-title":"Izvestiya VUZov, Radiofizika"},{"key":"9_CR3","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\u00a028, 337\u2013345 (1984)","journal-title":"Theoretical Computer Science"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-642-22993-0_25","volume-title":"Mathematical Foundations of Computer Science 2011","author":"E. Demenkov","year":"2011","unstructured":"Demenkov, E., Kulikov, A.S.: An Elementary Proof of a 3n \u2212 o(n) Lower Bound on the Circuit Complexity of Affine Dispersers. In: Murlak, F., Sankowski, P. (eds.) MFCS 2011. LNCS, vol.\u00a06907, pp. 256\u2013265. Springer, Heidelberg (2011)"},{"key":"9_CR5","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"},{"issue":"7","key":"9_CR6","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":"9_CR7","series-title":"Efficient Algroithms of Foundations of Computing","volume-title":"Algorithmic Number Theory","author":"E. Bach","year":"1996","unstructured":"Bach, E., Shallit, J.O.: Algorithmic Number Theory. Efficient Algroithms of Foundations of Computing, vol.\u00a0I. MIT Press, Massachusetts (1996)"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Wegener, I.: The Complexity of Boolean Functions. Wiley-Teubner (1987)","DOI":"10.1007\/3-540-18170-9_185"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30642-6_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:47:54Z","timestamp":1620128874000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30642-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642306419","9783642306426"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30642-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}