{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T22:51:24Z","timestamp":1649026284550},"reference-count":8,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4307,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0166-218x(00)00361-9","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"61-93","source":"Crossref","is-referenced-by-count":2,"title":["Lower bounds for the complexity of restrictions of Boolean functions"],"prefix":"10.1016","volume":"114","author":[{"given":"A.V.","family":"Chashkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00361-9_BIB1","unstructured":"A.E. Andreev, On the circuit complexity of partial boolean functions, Discrete Math. 4 (1989) 36\u201345 (in Russian)."},{"issue":"3","key":"10.1016\/S0166-218X(00)00361-9_BIB2","first-page":"402","article-title":"On estimates on the complexity of restrictions of boolean functions","volume":"53","author":"Chashkin","year":"1996","journal-title":"Dokl. Math."},{"issue":"3","key":"10.1016\/S0166-218X(00)00361-9_BIB3","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1515\/dma.1996.6.3.257","article-title":"On the complexity of restrictions of boolean functions","volume":"6","author":"Chashkin","year":"1996","journal-title":"Discret. Math. Appl."},{"key":"10.1016\/S0166-218X(00)00361-9_BIB4","doi-asserted-by":"crossref","unstructured":"A.V. Chashkin, Average-case complexity of finite boolean functions, Discrete Appl. Math. 114 (2001) 43\u201359.","DOI":"10.1016\/S0166-218X(00)00360-7"},{"key":"10.1016\/S0166-218X(00)00361-9_BIB5","unstructured":"E.G. Krasulina, On the complexity of implementing monotone symmetric boolean functions by contact circuits, Mathematical Problems in Cybernetics, Vol. 1, Moscow, Nauka, 1988, pp. 140\u2013167 (in Russian)."},{"key":"10.1016\/S0166-218X(00)00361-9_BIB6","unstructured":"O.B. Lupanov, An approach to synthesis of control systems \u2013 the principle of local coding, Problems in Cybernetics, vol. 14, Moscow, Nauka, 1965, pp. 31\u2013110 (in Russian)."},{"key":"10.1016\/S0166-218X(00)00361-9_BIB7","unstructured":"O.B. Lupanov, Asymptotic bounds for the complexity of control systems, Moscow, Mosk. Gos. Univ., 1984 (in Russian)."},{"key":"10.1016\/S0166-218X(00)00361-9_BIB8","unstructured":"L.A. Sholomov, On the implementation of partial boolean functions by circuits, Problems in Cybernetics 21, Moscow, Nauka, 1969, pp. 215\u2013226 (in Russian)."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003619?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003619?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T20:25:46Z","timestamp":1556223946000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003619"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":8,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0166218X00003619"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00361-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}