|
Transformations of variables invariant under minimization of binary functions of multivalued arguments
A. V. Panov Faculty of Computational Mathematics and Cybernetics, Moscow State University, Moscow, Russia
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.
Key words:
disjunctive normal forms, binary functions of multivalued arguments, $k$-valued logic, functions with few zeros, complexity of disjunctive normal forms, invariant transformations of variables.
Received: 02.07.2015
Citation:
A. V. Panov, “Transformations of variables invariant under minimization of binary functions of multivalued arguments”, Zh. Vychisl. Mat. Mat. Fiz., 56:8 (2016), 1536–1540; Comput. Math. Math. Phys., 56:8 (2016), 1517–1521
Linking options:
https://www.mathnet.ru/eng/zvmmf10444 https://www.mathnet.ru/eng/zvmmf/v56/i8/p1536
|
Statistics & downloads: |
Abstract page: | 151 | Full-text PDF : | 31 | References: | 50 | First page: | 11 |
|