This is a preview of subscription content, log in via an institution to check access.
Literature Cited
M. A. Harrison, “The number of classes of invertible Boolean functions,” J. Assoc. Comput. Mach.,10, No. 1, 25–28 (1963).
M. A. Harrison, “On the classification of Boolean functions of the general linear and affine groups,” J. Soc. Industr. Appl. Math.,12, No. 2, 285–299 (1964).
C. S. Lorens, “Invertible Boolean functions,” IEEE Trans. Electronic Computers,EC-13, No. 5, 529–541 (1964).
I. É. Strazdin', “On the number of types of invertible binary networks,” Avtomat. Vychisl. Tekh., No. 1, 30–34 (1974).
N. G. de Bruijn, “Polya's theory of counting,” in: Applied Combinatorial Mathematics, E. F. Beckenbach (ed.), Wiley, New York (1964), pp. 144–184.
É. A. Primenko, “Invertible Boolean functions and fundamental groups of transformations of algebras of Boolean functions,” Avtomat. Vychisl. Tekh., No. 3, 17–21 (1976).
É. A. Primenko, “On the number of types of invertible Boolean functions,” Avtomat. Vychisl. Tekh., No. 6, 12–14 (1977).
É. A. Primenko, “On the number of types of invertible transformations in multivalued logic,” Kibernetika, No. 5, 27–29 (1977).
É. A. Primenko, “On the number of equivalence classes with respect to certain subgroups of a symmetric group,” Kibernetika, No. 6, 19–22 (1979).
H. Wielandt, Finite Permutation Groups, Academic Press, New York (1964).
M. Hall, Jr., The Theory of Groups, Macmillan, New York (1959).
H. J. Ryser, Combinatorial Mathematics, The Math. Assoc. of America (1963).
Additional information
Translated from Kibernetika, No. 6, pp. 1–5, November–December, 1984.
Rights and permissions
About this article
Cite this article
Primenko, É.A. Equivalence classes of invertible Boolean functions. Cybern Syst Anal 20, 771–776 (1984). https://doi.org/10.1007/BF01072161
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01072161