Geodesic
The generalized complexity of linear Boolean functions
Diskretnaya Matematika, Tome 30 (2018) no. 4, pp. 88-96.

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

@article{DM_2018_30_4_a7,
     author = {N. P. Red'kin},
     title = {The generalized complexity of linear {Boolean} functions},
     journal = {Diskretnaya Matematika},
     pages = {88--96},
     publisher = {mathdoc},
     volume = {30},
     number = {4},
     year = {2018},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2018_30_4_a7/}
}
TY  - JOUR
AU  - N. P. Red'kin
TI  - The generalized complexity of linear Boolean functions
JO  - Diskretnaya Matematika
PY  - 2018
SP  - 88
EP  - 96
VL  - 30
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2018_30_4_a7/
LA  - ru
ID  - DM_2018_30_4_a7
ER  - 
%0 Journal Article
%A N. P. Red'kin
%T The generalized complexity of linear Boolean functions
%J Diskretnaya Matematika
%D 2018
%P 88-96
%V 30
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2018_30_4_a7/
%G ru
%F DM_2018_30_4_a7
N. P. Red'kin. The generalized complexity of linear Boolean functions. Diskretnaya Matematika, Tome 30 (2018) no. 4, pp. 88-96. http://geodesic.mathdoc.fr/item/DM_2018_30_4_a7/

[1] Lupanov O.B., Asimptoticheskie otsenki slozhnosti upravlyayuschikh sistem, Izd-vo MGU, M., 1984, 138 pp.

[2] Redkin N. P., “A generalization of Shannon function”, Discrete Math. Appl., 28:5 (2018), 309–318 | DOI | DOI | MR

[3] Yablonskii S.V., Vvedenie v diskretnuyu matematiku, Vysshaya shkola, M., 2003, 384 pp.

[4] Redkin N.P, “Dokazatelstvo minimalnosti nekotorykh skhem iz funktsionalnykh elementov”, Problemy kibernetiki, 1970, no. 23, 83–101 | MR | Zbl

[5] Redkin N.P., “O minimalnoi realizatsii lineinoi funktsii skhemoi iz funktsinalnykh elementov”, Kibernetika, 1971, no. 6, 31–38 | Zbl

[6] Shkrebela I. S., “On complexity of realisation of linear Boolean functions by circuits of functional elements over the basis $\{x \rightarrow y, \overline{x}\}$”, Discrete Math. Appl., 13:5 (2003), 483–496 | DOI | DOI | MR | Zbl

[7] Kombarov Yu. A., “The minimal circuits for linear Boolean functions”, Moscow University Mechanics Bulletin, 66:6 (2011), 260–263 | DOI | MR | Zbl

[8] Kombarov Yu.A., “O minimalnykh realizatsiyakh lineinykh bulevykh funktsii”, Diskretnyi analiz i issledovanie operatsii, 19:3 (2012), 39–57 | MR | Zbl

[9] Kombarov Yu. A., “On minimal circuits for linear functions over some bases”, Discrete Math. Appl., 23:1 (2013), 39–51 | DOI | DOI | MR | MR | Zbl

[10] Kombarov Yu. A., “Complexity of realization of a linear Boolean function in Sheffer's basis”, Moscow Univ. Math. Bull., 68:2, 114–117 | DOI | Zbl

[11] Kombarov Yu.A., “O minimalnykh skhemakh v bazise Sheffera dlya lineinykh bulevykh funktsii”, Diskretnyi analiz i issledovanie operatsii, 20:4 (2013), 65–87 | MR | Zbl

[12] Redkin N.P., “O polnykh proveryayuschikh testakh dlya skhem iz funktsionalnykh elementov”, Matematicheskie voprosy kibernetiki, 1989, no. 2, 198–222 | MR | Zbl