Geodesic
On application of generalised polynomials to constructing algorithms to recognise properties of $k$-valued functions defined by polynomials
Diskretnaya Matematika, Tome 24 (2012) no. 3, pp. 51-61.

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

@article{DM_2012_24_3_a4,
     author = {A. V. Bukhman},
     title = {On application of generalised polynomials to constructing algorithms to recognise properties of $k$-valued functions defined by polynomials},
     journal = {Diskretnaya Matematika},
     pages = {51--61},
     publisher = {mathdoc},
     volume = {24},
     number = {3},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2012_24_3_a4/}
}
TY  - JOUR
AU  - A. V. Bukhman
TI  - On application of generalised polynomials to constructing algorithms to recognise properties of $k$-valued functions defined by polynomials
JO  - Diskretnaya Matematika
PY  - 2012
SP  - 51
EP  - 61
VL  - 24
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2012_24_3_a4/
LA  - ru
ID  - DM_2012_24_3_a4
ER  - 
%0 Journal Article
%A A. V. Bukhman
%T On application of generalised polynomials to constructing algorithms to recognise properties of $k$-valued functions defined by polynomials
%J Diskretnaya Matematika
%D 2012
%P 51-61
%V 24
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2012_24_3_a4/
%G ru
%F DM_2012_24_3_a4
A. V. Bukhman. On application of generalised polynomials to constructing algorithms to recognise properties of $k$-valued functions defined by polynomials. Diskretnaya Matematika, Tome 24 (2012) no. 3, pp. 51-61. http://geodesic.mathdoc.fr/item/DM_2012_24_3_a4/

[1] Selezneva S. N., “O slozhnosti raspoznavaniya polnoty mnozhestva bulevykh funktsii, realizovannykh polinomami Zhegalkina”, Diskretnaya matematika, 9:4 (1997), 24–31 | DOI | MR | Zbl

[2] Selezneva S. N., “Polinomialnyi algoritm dlya raspoznavaniya prinadlezhnosti realizovannoi polinomom funktsii $k$-znachnoi logiki predpolnym klassam samodvoistvennykh funktsii”, Diskretnaya matematika, 10:3 (1998), 64–72 | DOI | MR | Zbl

[3] Gorshkov S. N., “O slozhnosti raspoznavaniya multiaffinnosti, biyunktivnosti, slaboi polozhitelnosti i slaboi otritsatelnosti bulevoi funktsii”, Obozrenie prikladnoi i promyshlennoi matematiki, 4:2 (1997), 216–237

[4] Yablonskii S. V., Gavrilov G. P., Nabebin A. A., Predpolnye klassy v mnogoznachnykh logikakh, MEI, Moskva, 1997 | MR

[5] Yablonskii S. V., “Funktsionalnye postroeniya v $k$-znachnoi logike”, Trudy Matematicheskogo instituta im. V. A. Steklova AN SSSR, 51, 1958, 5–142 | MR | Zbl

[6] Akho A., Khopkroft Dzh., Ulman Dzh., Postroenie i analiz vychislitelnykh algoritmov, Mir, Moskva, 1979 | MR

[7] Aierlend K., Rouzen M., Klassicheskoe vvedenie v sovremennuyu teoriyu chisel, Mir, Moskva, 1987 | MR