The complexity of the representation of multiple-output Boolean functions
From MaRDI portal
Publication:332335
zbMATH Open1354.94074MaRDI QIDQ332335FDOQ332335
Authors: Sergeĭ Fedorovich Vinokurov, Anastasiya Sergeevna Frantseva 
Publication date: 8 November 2016
Published in: The Bulletin of Irkutsk State University. Series Mathematics (Search for Journal in Brave)
Full work available at URL: http://isu.ru/journal/downloadArticle?article=_98a8b64bb79447e4b17289cf4fe21200&lang=rus
Recommendations
- An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits
- scientific article; zbMATH DE number 2163011
- Multiplicative complexity of some Boolean functions
- An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli
- On the multiplicative complexity of Boolean functions
Cites Work
Cited In (11)
- Title not available (Why is that?)
- An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli
- The complexity of the descriptiveness of Boolean circuits over different sets of gates
- Algebras of binary isolating formulas
- Enumeration of reversible functions and its application to circuit complexity
- A finite alternation result for reversible Boolean circuits
- On the multiplicative complexity of Boolean functions and bitsliced higher-order masking
- Behavior of Shannon functions for complexity of parametric representations of Boolean functions
- Complexity of Boolean functions' representations in classes of extended pair-generated operator forms
- Title not available (Why is that?)
- An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits
This page was built for publication: The complexity of the representation of multiple-output Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q332335)
