An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits

DOI10.26516/1997-7670.2018.25.144zbMath1409.94950OpenAlexW2893458832MaRDI QIDQ1717423

Anastasiya Sergeevna Frantseva

Publication date: 5 February 2019

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

Full work available at URL: http://mathizv.isu.ru/assets/articles/c0195bec-9c18-4e30-be8f-56104e36dc28.pdf

zbMATH Keywords

Boolean functionsreversible circuitpolarized zhegalkin polynomials or Reed-Muller formsToffoli functions

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of the representation of multiple-output Boolean functions
• An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli
• Conservative logic
• MMIXware. A RISC computer for the third millennium.

This page was built for publication: An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits