|
This article is cited in 3 scientific papers (total in 3 papers)
Complexity of tests checking the operation of logic diagram inputs
V. N. Noskov Institute of Mathematics, Academy of Sciences of the USSR, Siberian Branch
Abstract:
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$.
Received: 06.11.1973
Citation:
V. N. Noskov, “Complexity of tests checking the operation of logic diagram inputs”, Mat. Zametki, 18:1 (1975), 137–150; Math. Notes, 18:1 (1975), 664–670
Linking options:
https://www.mathnet.ru/eng/mzm7635 https://www.mathnet.ru/eng/mzm/v18/i1/p137
|
|