Matematičeskie zametki, Tome 18 (1975) no. 1, pp. 137-150
Citer cet article
V. N. Noskov. Complexity of tests checking the operation of logic diagram inputs. Matematičeskie zametki, Tome 18 (1975) no. 1, pp. 137-150. http://geodesic.mathdoc.fr/item/MZM_1975_18_1_a17/
@article{MZM_1975_18_1_a17,
author = {V. N. Noskov},
title = {Complexity of tests checking the operation of logic diagram inputs},
journal = {Matemati\v{c}eskie zametki},
pages = {137--150},
year = {1975},
volume = {18},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_1975_18_1_a17/}
}
TY - JOUR
AU - V. N. Noskov
TI - Complexity of tests checking the operation of logic diagram inputs
JO - Matematičeskie zametki
PY - 1975
SP - 137
EP - 150
VL - 18
IS - 1
UR - http://geodesic.mathdoc.fr/item/MZM_1975_18_1_a17/
LA - ru
ID - MZM_1975_18_1_a17
ER -
%0 Journal Article
%A V. N. Noskov
%T Complexity of tests checking the operation of logic diagram inputs
%J Matematičeskie zametki
%D 1975
%P 137-150
%V 18
%N 1
%U http://geodesic.mathdoc.fr/item/MZM_1975_18_1_a17/
%G ru
%F MZM_1975_18_1_a17
Exact upper bounds for the complexity of absolute tests checking the correctness of inputs of logic diagrams realizing Boolean functions which are essentially dependent on $n$ variables have been found for $n\ge136$.
