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 ≥ 136.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature cited
C. D. Weiss, “Bounds on the length of terminal stuck-fault tests,” IEEE Trans. Comput.,C21, No. 3, 305–309.
I. A. Chegis and S. V. Yablonskii, “Logic methods of checking electrical circuit operation,” Tr. Matem. In-ta Akad. Nauk SSSR,60, 270–360 (1958).
O. B. Lupanov, “On a class of schemes of functional elements,” in: Cybernetic Problems [in Russian], No. 7, Fizmatgiz, Moscow (1962), pp. 61–114.
Author information
Authors and Affiliations
Additional information
Translated from Matematicheskie Zametki, Vol. 18, No. 1, pp. 137–150, July, 1975.
The author is grateful to V. V. Glagolev for valuable comments and attention to the research.
Rights and permissions
About this article
Cite this article
Noskov, V.N. Complexity of tests checking the operation of logic diagram inputs. Mathematical Notes of the Academy of Sciences of the USSR 18, 664–670 (1975). https://doi.org/10.1007/BF01461151
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01461151