Diskretnyj analiz i issledovanie operacij, Tome 1 (1994) no. 4, pp. 33-52
Citer cet article
K. L. Rychkov. Lower bounds on the complexity of parallel-sequential switching circuits that realize linear Boolean functions. Diskretnyj analiz i issledovanie operacij, Tome 1 (1994) no. 4, pp. 33-52. http://geodesic.mathdoc.fr/item/DA_1994_1_4_a3/
@article{DA_1994_1_4_a3,
author = {K. L. Rychkov},
title = {Lower bounds on the complexity of parallel-sequential switching circuits that realize linear {Boolean} functions},
journal = {Diskretnyj analiz i issledovanie operacij},
pages = {33--52},
year = {1994},
volume = {1},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DA_1994_1_4_a3/}
}
TY - JOUR
AU - K. L. Rychkov
TI - Lower bounds on the complexity of parallel-sequential switching circuits that realize linear Boolean functions
JO - Diskretnyj analiz i issledovanie operacij
PY - 1994
SP - 33
EP - 52
VL - 1
IS - 4
UR - http://geodesic.mathdoc.fr/item/DA_1994_1_4_a3/
LA - ru
ID - DA_1994_1_4_a3
ER -
%0 Journal Article
%A K. L. Rychkov
%T Lower bounds on the complexity of parallel-sequential switching circuits that realize linear Boolean functions
%J Diskretnyj analiz i issledovanie operacij
%D 1994
%P 33-52
%V 1
%N 4
%U http://geodesic.mathdoc.fr/item/DA_1994_1_4_a3/
%G ru
%F DA_1994_1_4_a3
