{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:06Z","timestamp":1725558906874},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201038"},{"type":"electronic","value":"9783540398165"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39816-5_14","type":"book-chapter","created":{"date-parts":[[2010,6,27]],"date-time":"2010-06-27T22:01:32Z","timestamp":1277676092000},"page":"146-156","source":"Crossref","is-referenced-by-count":0,"title":["Average-Case Complexity of Partial Boolean Functions"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Chashkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Andreev, A.E.: On Circuit Complexity of Partial Boolean Functions. Diskret. Mat. 1(4), 36\u201345 (1989) (in Russian)"},{"key":"14_CR2","unstructured":"Sholomov, L.A.: On the Implementation of Partial Boolean Functions by Circuits. In: Problemy kibernetiki, vol.\u00a021, pp. 215\u2013226. Nauka, Moscow (1969) (in Russian)"},{"key":"14_CR3","first-page":"31","volume-title":"Problemy kibernetiki","author":"O.B. Lupanov","year":"1965","unstructured":"Lupanov, O.B.: An Approach to the Synthesis of Control Systems \u2013 The Principle of Local Coding. In: Problemy kibernetiki, vol.\u00a014, pp. 31\u2013110. Nauka, Moscow (1965)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Chashkin, A.V.: Average Case Complexity for Finite Boolean Functions. Discrete Applied Mathematics 114, 43\u201359 (2001)","DOI":"10.1016\/S0166-218X(00)00360-7"},{"key":"14_CR5","unstructured":"Chashkin, A.V.: Average Time of Computing Boolean Operators. Operations Research and Discrete Analysis, Ser. 1\u00a05(1), 88\u2013103 (1998) (in Russian)"},{"issue":"3","key":"14_CR6","first-page":"49","volume":"4","author":"A.V. Chashkin","year":"1997","unstructured":"Chashkin, A.V.: Computation of Boolean Functions by Randomized Programs. Operations Research and Discrete Analysis, Ser. 1\u00a04(3), 49\u201368 (1997)","journal-title":"Operations Research and Discrete Analysis, Ser. 1"},{"key":"14_CR7","first-page":"77","volume":"1","author":"A.V. Chashkin","year":"2001","unstructured":"Chashkin, A.V.: Average Time of Computing Boolean Operators. Discrete Math. and Appl.\u00a01, 77\u201382 (2001)","journal-title":"Discrete Math. and Appl."}],"container-title":["Lecture Notes in Computer Science","Stochastic Algorithms: Foundations and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39816-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T09:32:45Z","timestamp":1559208765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39816-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201038","9783540398165"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39816-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}