Research of reversible logic circuits consisting of NOT, CNOT and 2-CNOT gates
Main publications:
D. V. Zakablukov, “Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates”, Moscow University Mathematics Bulletin, 71:3 (2016), 89-97
D. V. Zakablukov, “On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates”, Discrete Math. Appl., 27:1 (2017), 57-67
D. V. Zakablukov, “On Synthesis of Reversible Circuits Consisting of NOT, CNOT and 2-CNOT Gates with Small Number of Additional Inputs”, Diskr. Mat., 33:3 (2021), 46–54
2020
2.
D. V. Zakablukov, “On the dependence of the complexity and depth of reversible circuits consisting of NOT, CNOT, and 2-CNOT gates on the number of additional inputs”, Diskr. Mat., 32:1 (2020), 8–26; Discrete Math. Appl., 31:1 (2021), 61–75
S. I. Gurov, A. E. Zhukov, D. V. Zakablukov, G. V. Kormakov, “Reversible calculations. Part II”, Taurida Journal of Computer Science Theory and Mathematics, 2019, no. 4, 27–58
4.
S. I. Gurov, A. E. Zhukov, D. V. Zakablukov, G. V. Kormakov, “Reversible calculations. Part I”, Taurida Journal of Computer Science Theory and Mathematics, 2019, no. 3, 37–65
2016
5.
D. V. Zakablukov, “On the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates”, Diskr. Mat., 28:2 (2016), 12–26; Discrete Math. Appl., 27:1 (2017), 57–67
D. V. Zakablukov, “Estimation of the depth of reversible circuits consisting of NOT, CNOT and 2-CNOT gates”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2016, no. 3, 3–12; Moscow University Mathematics Bulletin, 71:3 (2016), 89–97
