{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T07:57:21Z","timestamp":1648972641443},"reference-count":6,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1993]]},"DOI":"10.1051\/ita\/1993270402831","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T10:17:21Z","timestamp":1486030641000},"page":"283-293","source":"Crossref","is-referenced-by-count":1,"title":["On the positive and the inversion complexity of Boolean functions"],"prefix":"10.1051","volume":"27","author":[{"given":"V.","family":"Di\u010di\u016bnas","sequence":"first","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. DI\u010cI\u016aNAS V., Computing of symmetric functions with restricted threshold curcuits, Mathematical logic and its applications, Inst. of Math. and Cyb. of the Lithuanian Acad. of Sci., 6, 1989, pp. 38-50 (in Russian).1086979"},{"key":"R2","unstructured":"2. LUPANOV O. B., On synthesis of threshold circuits, Problemy kibernetiki, 26, 1973, pp. 109-140 (in Russian).4848090265.94026"},{"key":"R3","doi-asserted-by":"crossref","unstructured":"3. MARKOV A. A., On the inversion complexity of a system of functions, J. ACM, 5, 1958, pp. 331-334.1116860085.11601","DOI":"10.1145\/320941.320945"},{"key":"R4","unstructured":"4. REDKIN N. P., On synthesis of threshold circuits for some classes of Boolean functions, Kibernetika, 5, 1970 pp. 6-9 (in Russian).2908780225.94016"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. SANTHA M., WILSON C., Polynomial size constant depth circuits with a limited number of negations, LNCS, 480, 1991, pp. 228-237.11011730764.94025","DOI":"10.1007\/BFb0020801"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. WEGENER I., The complexity of the parity function in unbounded fan-in, unbounded depth circuits, Theor. Comp. Sc., 85, 1991, pp. 155-170.11181340749.94025","DOI":"10.1016\/0304-3975(91)90052-4"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270402831\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T02:01:27Z","timestamp":1568772087000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270402831"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":6,"journal-issue":{"issue":"4"},"alternative-id":["ita1993270402831"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1993270402831","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}