Email this article Transformations of variables invariant under minimization of binary functions of multivalued arguments
- Authors: Panov A.V.1
-
Affiliations:
- Faculty of Computational Mathematics and Cybernetics
- Issue: Vol 56, No 8 (2016)
- Pages: 1517-1521
- Section: Article
- URL: https://journals.rcsi.science/0965-5425/article/view/178623
- DOI: https://doi.org/10.1134/S0965542516080121
- ID: 178623
Cite item
Open Access
Access granted
Subscription Access
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.
About the authors
A. V. Panov
Faculty of Computational Mathematics and Cybernetics
Author for correspondence.
Email: panov.al.vit@gmail.com
Russian Federation, Moscow, 119991
Supplementary files
