Geodesic
On the complexity of representation of $k$-valued functions by generalised polarised polynomials
Diskretnaya Matematika, Tome 21 (2009) no. 4, pp. 20-29

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider generalised polarised polynomials for $k$-valued functions (for prime $k$). It is proved that each $k$-valued function is represented by some unique generalised polarised polynomial for each polarisation vector. We find upper and lower bounds for the Shannon functions of degree and length of the generalised polarised polynomials of $k$-valued functions. 
@article{DM_2009_21_4_a1,
     author = {S. N. Selezneva},
     title = {On the complexity of representation of $k$-valued functions by generalised polarised polynomials},
     journal = {Diskretnaya Matematika},
     pages = {20--29},
     publisher = {mathdoc},
     volume = {21},
     number = {4},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2009_21_4_a1/}
}
TY  - JOUR
AU  - S. N. Selezneva
TI  - On the complexity of representation of $k$-valued functions by generalised polarised polynomials
JO  - Diskretnaya Matematika
PY  - 2009
SP  - 20
EP  - 29
VL  - 21
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2009_21_4_a1/
LA  - ru
ID  - DM_2009_21_4_a1
ER  - 
%0 Journal Article
%A S. N. Selezneva
%T On the complexity of representation of $k$-valued functions by generalised polarised polynomials
%J Diskretnaya Matematika
%D 2009
%P 20-29
%V 21
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2009_21_4_a1/
%G ru
%F DM_2009_21_4_a1
S. N. Selezneva. On the complexity of representation of $k$-valued functions by generalised polarised polynomials. Diskretnaya Matematika, Tome 21 (2009) no. 4, pp. 20-29. http://geodesic.mathdoc.fr/item/DM_2009_21_4_a1/