naa a22 4500 510809928 CHVBK 20180411083438.0 cr unu---uuuuu 180411e20130701xx s 000 0 eng 10.1134/S1064230713030064 doi (NATIONALLICENCE)springer-10.1134/S1064230713030064 On the minimization of complexity and automation of efficient representation of boolean functions in classes of formulas and circuits [Elektronische Daten] [E. Egorova, I. Cheburakhin] A method for synthesizing Boolean formulas intended for the efficient construction of circuit composed on functional elements, which is also suitable for minimal complexity circuits, is developed. Upper bounds on the implementation complexity of arbitrary Boolean functions in terms of the Zhegalkin basis are determined. A computational method for improving these bounds is proposed. A method for deriving certain countable classes of Boolean functions of minimal complexity is also recommended. Pleiades Publishing, Ltd., 2013 Egorova E. Russian State Technological University MATI, Moscow, Russia aut Cheburakhin I. Russian State Technological University MATI, Moscow, Russia aut Journal of Computer and Systems Sciences International Springer US; http://www.springer-ny.com 52/4(2013-07-01), 618-627 1064-2307 52:4<618 2013 52 11488 https://doi.org/10.1134/S1064230713030064 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1134/S1064230713030064 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Egorova E. Russian State Technological University MATI, Moscow, Russia aut NATIONALLICENCE 700 1- Cheburakhin I. Russian State Technological University MATI, Moscow, Russia aut NATIONALLICENCE 773 0- Journal of Computer and Systems Sciences International Springer US; http://www.springer-ny.com 52/4(2013-07-01), 618-627 1064-2307 52:4<618 2013 52 11488 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer