Сводимость различных видов контактных схем к схемам из функциональных элементов
Veroâtnostnye metody i kibernetika, Tome 22 (1987), pp. 13-23
Cet article a éte moissonné depuis la source European Digital Mathematics Library
Mots-clés :
switching circuits, associated graph, Boolean functions, reduction, complexity, functional-element scheme
@article{VMK_1987__22_69251,
author = {{\CYRM}.{\CYRYU}. {\CYRM}{\cyro}{\cyrsh}{\cyrk}{\cyro}{\cyrv}},
title = {{\CYRS}{\cyrv}{\cyro}{\cyrd}{\cyri}{\cyrm}{\cyro}{\cyrs}{\cyrt}{\cyrsftsn} {\cyrr}{\cyra}{\cyrz}{\cyrl}{\cyri}{\cyrch}{\cyrn}{\cyrery}{\cyrh} {\cyrv}{\cyri}{\cyrd}{\cyro}{\cyrv} {\cyrk}{\cyro}{\cyrn}{\cyrt}{\cyra}{\cyrk}{\cyrt}{\cyrn}{\cyrery}{\cyrh} {\cyrs}{\cyrh}{\cyre}{\cyrm} {\cyrk} {\cyrs}{\cyrh}{\cyre}{\cyrm}{\cyra}{\cyrm} {\cyri}{\cyrz} {\cyrf}{\cyru}{\cyrn}{\cyrk}{\cyrc}{\cyri}{\cyro}{\cyrn}{\cyra}{\cyrl}{\cyrsftsn}{\cyrn}{\cyrery}{\cyrh} {\cyrerev}{\cyrl}{\cyre}{\cyrm}{\cyre}{\cyrn}{\cyrt}{\cyro}{\cyrv}},
journal = {Vero\^atnostnye metody i kibernetika},
pages = {13--23},
year = {1987},
volume = {22},
zbl = {0714.94028},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMK_1987__22_69251/}
}
М.Ю. Мошков. Сводимость различных видов контактных схем к схемам из функциональных элементов. Veroâtnostnye metody i kibernetika, Tome 22 (1987), pp. 13-23. http://geodesic.mathdoc.fr/item/VMK_1987__22_69251/