On the complexity of polarized polynomials of functions of many-valued logics that depend on one variable
Diskretnaya Matematika, Tome 16 (2004) no. 2, pp. 117-120
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
We consider multi-valued logic functions represented by polarised polynomials. A polynomial is called polarised if each its variable can be polarised by a certain shift. We introduce the Shannon function which characterises the complexity of representations of multi-valued logic functions by polarised polynomials and obtain an exact estimate of the Shannon function for functions in one variable. This research was supported by the Russian Foundation for Basic Research, grant 00–01–00351.
[1] Lidl R., Niderraiter G., Konechnye polya, Mir, Moskva, 1988 | Zbl
[2] Peryazev N. A., “Slozhnost bulevykh funktsii v klasse polinomialnykh polyarizovannykh form”, Algebra i logika, 34 (1995), 323–326 | MR | Zbl
[3] Selezneva S. N., “O slozhnosti predstavleniya funktsii mnogoznachnykh logik polyarizovannymi polinomami”, Diskretnaya matematika, 14:2 (2002), 48–53 | MR | Zbl