An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli
From MaRDI portal
Publication:447717
zbMath1256.81028MaRDI QIDQ447717
Anastasiya Sergeevna Frantseva, Sergeĭ Fedorovich Vinokurov
Publication date: 5 September 2012
Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (3)
The complexity of the representation of multiple-output Boolean functions ⋮ Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates ⋮ An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits
This page was built for publication: An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli
