Geodesic
Minimal Contact Circuits for a Sequence of Boolean Functions
Matematičeskie zametki, Tome 110 (2021) no. 1, pp. 155-157 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Keywords: Boolean function, complexity of a circuit.
Mots-clés : contact circuit 
@article{MZM_2021_110_1_a14,
     author = {N. P. Red'kin},
     title = {Minimal {Contact} {Circuits} for a {Sequence} of {Boolean} {Functions}},
     journal = {Matemati\v{c}eskie zametki},
     pages = {155--157},
     year = {2021},
     volume = {110},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2021_110_1_a14/}
}
TY  - JOUR
AU  - N. P. Red'kin
TI  - Minimal Contact Circuits for a Sequence of Boolean Functions
JO  - Matematičeskie zametki
PY  - 2021
SP  - 155
EP  - 157
VL  - 110
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/MZM_2021_110_1_a14/
LA  - ru
ID  - MZM_2021_110_1_a14
ER  - 
%0 Journal Article
%A N. P. Red'kin
%T Minimal Contact Circuits for a Sequence of Boolean Functions
%J Matematičeskie zametki
%D 2021
%P 155-157
%V 110
%N 1
%U http://geodesic.mathdoc.fr/item/MZM_2021_110_1_a14/
%G ru
%F MZM_2021_110_1_a14
N. P. Red'kin. Minimal Contact Circuits for a Sequence of Boolean Functions. Matematičeskie zametki, Tome 110 (2021) no. 1, pp. 155-157. http://geodesic.mathdoc.fr/item/MZM_2021_110_1_a14/

[1] O. B. Lupanov, Asimptoticheskie otsenki slozhnosti upravlyayuschikh sistem, Izd-vo Mosk. un-ta, M., 1984

[2] C. E. Shannon, Bell System Tech. J., 28:1 (1949), 59–98 | DOI | MR

[3] N. P. Redkin, Matem. zametki, 108:3 (2020), 397–411 | DOI

[4] N. P. Redkin, Diskret. matem., 32:3 (2020), 68–75 | DOI

[5] N. P. Redkin, Diskretn. analiz i issled. oper., ser. 1, 5:3 (1998), 44–63 | MR | Zbl

[6] S. V. Yablonskii, Vvedenie v diskretnuyu matematiku, Vysshaya shkola, M., 2003 | MR

[7] N. P. Redkin, Nadezhnost i diagnostika skhem, Izd-vo Mosk. un-ta, M., 1992