Geodesic
Criteria for Boolean functions to be repetition-free in pre-elementary bases of rank 3
Diskretnaya Matematika, Tome 17 (2005) no. 2, pp. 127-138 
N. A. Peryazev; I. K. Sharankhaev. Criteria for Boolean functions to be repetition-free in pre-elementary bases of rank 3. Diskretnaya Matematika, Tome 17 (2005) no. 2, pp. 127-138. http://geodesic.mathdoc.fr/item/DM_2005_17_2_a9/
@article{DM_2005_17_2_a9,
     author = {N. A. Peryazev and I. K. Sharankhaev},
     title = {Criteria for {Boolean} functions to be repetition-free in pre-elementary bases of rank~3},
     journal = {Diskretnaya Matematika},
     pages = {127--138},
     year = {2005},
     volume = {17},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2005_17_2_a9/}
}
TY  - JOUR
AU  - N. A. Peryazev
AU  - I. K. Sharankhaev
TI  - Criteria for Boolean functions to be repetition-free in pre-elementary bases of rank 3
JO  - Diskretnaya Matematika
PY  - 2005
SP  - 127
EP  - 138
VL  - 17
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DM_2005_17_2_a9/
LA  - ru
ID  - DM_2005_17_2_a9
ER  - 
%0 Journal Article
%A N. A. Peryazev
%A I. K. Sharankhaev
%T Criteria for Boolean functions to be repetition-free in pre-elementary bases of rank 3
%J Diskretnaya Matematika
%D 2005
%P 127-138
%V 17
%N 2
%U http://geodesic.mathdoc.fr/item/DM_2005_17_2_a9/
%G ru
%F DM_2005_17_2_a9

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

We study representations of Boolean functions by formulas and describe in terms of remainder functions the classes of repetition-free Boolean functions in the pre-elementary bases \begin{gather*} \{\vee, \cdot, -, 0, 1, x_1x_2x_3 \vee \bar{x}_1\bar{x}_2\bar{x}_3\}, \qquad \{\vee, \cdot, -, 0, 1, x_1(x_2 \vee x_3) \vee x_2x_3\},\\ \{\vee, \cdot, -, 0, 1, x_1(x_2 \vee x_3) \vee x_2\bar{x}_3\}. \end{gather*}

[1] Subbotovskaya B. A., “O sravnenii bazisov pri realizatsii funktsii algebry logiki formulami”, Dokl. AN SSSR, 149:4 (1963), 784–787 | Zbl

[2] Gurvich V. A., “Kriterii bespovtornosti funktsii algebry logiki”, Dokl. AN SSSR, 318:3 (1991), 532–537 | MR | Zbl

[3] Peryazev N. A., “Realizatsiya bulevykh funktsii bespovtornymi formulami v nekotorykh bazisakh”, Algebra, logika i prilozheniya, Irkutsk, 1994, 143–154

[4] Peryazev N. A., “Realizatsiya bulevykh funktsii bespovtornymi formulami”, Diskretnaya matematika, 7:3 (1995), 61–68 | MR | Zbl

[5] Kirichenko K. D., “O kriteriyakh bespovtornosti bulevykh funktsii v razlichnykh bazisakh”, Optimizatsiya, upravlenie, intellekt, 4 (2000), 93–101

[6] Vinokurov S. F., Peryazev N. A., Izbrannye voprosy teorii bulevykh funktsii, Fizmatlit, Moskva, 2001 | Zbl

[7] Stetsenko V. A., “O predplokhikh bazisakh v $P_2$”, Matem. voprosy kibern., 4 (1992), 139–177 | MR | Zbl

[8] Kirichenko K. D., “Slabopovtornye bulevy funktsii v nekotorykh predelementarnykh bazisakh”, Diskretnaya matematika i informatika, 13, Izd-vo Irkutskogo un-ta, Irkutsk, 2000

[9] Sharankhaev I. K., “Slabopovtornye bulevy funktsii v nekotorykh bazisakh”, Diskretnaya matematika i informatika, 17, Izd-vo Irkutskogo un-ta, Irkutsk, 2003

[10] Cherukhin D. Yu., “Algoritmicheskii kriterii sravneniya bulevykh bazisov”, Matem. voprosy kibern., 8 (1999), 77–122 | MR | Zbl