The complexity of Boolean functions in the class of reversible circuits. Parallel algorithms of reversible functions.
Main publications:
S. F. Vinokurov, A. S. Frantseva, “Priblizhennyi algoritm vychisleniya slozhnosti obratimoi funktsii v bazise Toffoli”, Izvestiya Irkutskogo gosudarstvennogo universiteta, 4:4 (2011), 12–26
A. S. Frantseva, “Complexity of Boolean functions' representations in classes of extended pair-generated operator forms”, Sib. Èlektron. Mat. Izv., 16 (2019), 523–541
A. S. Frantseva, “An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits”, Bulletin of Irkutsk State University. Series Mathematics, 25 (2018), 144–158
2016
3.
S. F. Vinokurov, A. S. Frantseva, “The complexity of the representation of multiple-output Boolean functions”, Bulletin of Irkutsk State University. Series Mathematics, 16 (2016), 30–42
S. F. Vinokurov, A. S. Frantseva, “An approximate algorithm for computing the complexity of reversible functions in the basis of Toffoli”, Bulletin of Irkutsk State University. Series Mathematics, 4:4 (2011), 12–26