The complexity of the representation of multiple-output Boolean functions

zbMath1354.94074MaRDI QIDQ332335

Sergeĭ Fedorovich Vinokurov, Anastasiya Sergeevna Frantseva

Publication date: 8 November 2016

Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)

Full work available at URL: http://isu.ru/journal/downloadArticle?article=_98a8b64bb79447e4b17289cf4fe21200&lang=rus

zbMATH Keywords

complexityBoolean functionShannon functionReed-Muller formsreversible circuitsToffoli gates

Mathematics Subject Classification ID

Related Items (3)

Complexity of Boolean functions' representations in classes of extended pair-generated operator forms ⋮ An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits ⋮ Algebras of binary isolating formulas

Cites Work

• Unnamed Item
• An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli
• Polynomial expansions of Boolean functions
• Bicontinuous extensions of invertible combinatorial functions

This page was built for publication: The complexity of the representation of multiple-output Boolean functions