On the complexity of reliable networks from functional gates in the case of constant faults of the same type at the outputs of the gates

MaRDI QIDQ1803057zbMATH OpenFDO

Authors M. A. Alekhina

Publication date 29 June 1993

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

Boolean function

Mathematics Subject Classification ID

Review text

See the review in Zbl 0772.94018.

Cited in

(2)

• Diagnosis of three types of constant faults in read-once contact networks over finite bases
• scientific article; zbMATH DE number 5906481 (Why is no real title available?)

This page was built for publication: On the complexity of reliable networks from functional gates in the case of constant faults of the same type at the outputs of the gates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1803057)