Geodesic
Minimal Contact Circuits for a Sequence of Boolean Functions
Matematičeskie zametki, Tome 110 (2021) no. 1, pp. 155-157

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

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},
     publisher = {mathdoc},
     volume = {110},
     number = {1},
     year = {2021},
     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
PB  - mathdoc
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
%I mathdoc
%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/