236
P. Kerntopf et al.
21. Primenko, E.A.: On the number of types of invertible Boolean functions. Avtomatika Vychislitelnaya Tekhnika. 6, 12–14 (1977)
22. Primenko, E.A.: On the number of types of invertible transformations in multivalued logic.
Kibernetika. 5, 27–29 (1977)
23. Primenko, E.A.: Equivalence classes of invertible Boolean functions. Kibernetika. 6, 1–5
(1984)
24. Rice, J.E.: Considerations for determining a classification scheme for reversible Boolean
functions. Technical report TR-CSJR2–2007, University of Lethbridge, Lethbridge (2007)
25. Soeken, M., Abdessaied, N., de Micheli, G.: Enumeration of reversible functions and its
application to circuit complexity. In: Devitt, S., Lanese, I. (eds.) Reversible Computation.
Proceedings of the 8th International Conference, RC 2016, Bologna, Italy, July 7–8, 2016,
Lecture Notes in Computer Science, vol. 9720, pp. 255–270, Springer, Cham (2016)
26. Draper, T.G.: Nonlinear complexity of Boolean permutations. PhD thesis, University of
Maryland, College Park (2009)
27. Aaronson, S., Grier, D., Schaeffer, L.: The classification of reversible bit operations. Preprint
arXiv:1504.05155 [quant-ph], 68 p. (2015)
28. Cari´ c, M., Živkovi´ c, M.: On the number of equivalence classes of invertible Boolean functions
under action of permutation of variables on domain and range. Publications de l’Institut Mathématique. 100(114), 95–99 (2016)., also available as preprint arXiv:1603.04386v2 [math.CO],
9 pages, April 6, 2016
29. Jegier, J., Kerntopf, P., Szyprowski, M.: An approach to constructing reversible multi-qubit
benchmarks with provably minimal implementations. In: Proceedings of the 13th IEEE
International Conference on Nanotechnology, pp. 99–104 (2013)
30. Jegier, J., Kerntopf, P.: Progress towards constructing sequences of benchmarks for quantum
Boolean circuits synthesis. In: Proceedings of the 14th IEEE International Conference on
Nanotechnology, pp. 250–255 (2014)
P. Kerntopf et al.
21. Primenko, E.A.: On the number of types of invertible Boolean functions. Avtomatika Vychislitelnaya Tekhnika. 6, 12–14 (1977)
22. Primenko, E.A.: On the number of types of invertible transformations in multivalued logic.
Kibernetika. 5, 27–29 (1977)
23. Primenko, E.A.: Equivalence classes of invertible Boolean functions. Kibernetika. 6, 1–5
(1984)
24. Rice, J.E.: Considerations for determining a classification scheme for reversible Boolean
functions. Technical report TR-CSJR2–2007, University of Lethbridge, Lethbridge (2007)
25. Soeken, M., Abdessaied, N., de Micheli, G.: Enumeration of reversible functions and its
application to circuit complexity. In: Devitt, S., Lanese, I. (eds.) Reversible Computation.
Proceedings of the 8th International Conference, RC 2016, Bologna, Italy, July 7–8, 2016,
Lecture Notes in Computer Science, vol. 9720, pp. 255–270, Springer, Cham (2016)
26. Draper, T.G.: Nonlinear complexity of Boolean permutations. PhD thesis, University of
Maryland, College Park (2009)
27. Aaronson, S., Grier, D., Schaeffer, L.: The classification of reversible bit operations. Preprint
arXiv:1504.05155 [quant-ph], 68 p. (2015)
28. Cari´ c, M., Živkovi´ c, M.: On the number of equivalence classes of invertible Boolean functions
under action of permutation of variables on domain and range. Publications de l’Institut Mathématique. 100(114), 95–99 (2016)., also available as preprint arXiv:1603.04386v2 [math.CO],
9 pages, April 6, 2016
29. Jegier, J., Kerntopf, P., Szyprowski, M.: An approach to constructing reversible multi-qubit
benchmarks with provably minimal implementations. In: Proceedings of the 13th IEEE
International Conference on Nanotechnology, pp. 99–104 (2013)
30. Jegier, J., Kerntopf, P.: Progress towards constructing sequences of benchmarks for quantum
Boolean circuits synthesis. In: Proceedings of the 14th IEEE International Conference on
Nanotechnology, pp. 250–255 (2014)