Abstract
A number of transformations are introduced that are invariant under minimization problems and make it possible to reduce the maximum possible number of distinct columns in the matrix of zeros of an arbitrary binary function of multivalued arguments. As a result, simpler disjunctive normal forms are constructed. Complexity bounds for the constructed disjunctive normal forms of arbitrary binary functions of k-valued arguments are given.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. V. Panov, “Binary functions of multivalued arguments: Generalization and investigation of disjunctive normal forms for such functions,” Comput. Math. Math. Phys. 55 (1), 131–139 (2015).
B. C. Rennie and A. J. Dobson, “On Stirling numbers of the second kind,” J. Combinatorial Theory 7 (2), 116–121 (1969).
Yu. I. Zhuravlev and A. Yu. Kogan, “Realization of Boolean functions with a small number of zeros by disjunctive normal forms, and related problems,” Sov. Math. Dokl. 32, 771–775 (1985).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © A.V. Panov, 2016, published in Zhurnal Vychislitel’noi Matematiki i Matematicheskoi Fiziki, 2016, Vol. 56, No. 8, pp. 1536–1540.
Rights and permissions
About this article
Cite this article
Panov, A.V. Transformations of variables invariant under minimization of binary functions of multivalued arguments. Comput. Math. and Math. Phys. 56, 1517–1521 (2016). https://doi.org/10.1134/S0965542516080121
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0965542516080121