Transformations of variables invariant under minimization of binary functions of multivalued arguments
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 56 (2016) no. 8, pp. 1536-1540
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
[1] Panov A. V., “Binarnye funktsii mnogoznachnykh argumentov. Obobscheniya i issledovaniya diz'yunktivnykh normalnykh form dlya takikh funktsii”, Zh. vychisl. matem. i matem. fiz., 55:1 (2015), 135–144 | DOI | Zbl
[2] Rennie B. C., Dobson A. J., “On stirling numbers of the second kind”, J. Combinatorial Theory, 7:2 (1969), 116–121 | DOI | MR | Zbl
[3] Zhuravlev Yu. I., Kogan A. Yu., “Realizatsiya bulevykh funktsii s malym chislom nulei diz'yunktivnymi normalnymi formami i smezhnye zadachi”, Dokl. AN SSSR, 285:4 (1985), 795–799 | MR | Zbl