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

zbMATH Open0790.94025MaRDI QIDQ1803057FDOQ1803057

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

Cited In (2)

• Diagnosis of three types of constant faults in read-once contact networks over finite bases
• Title not available (Why is that?)

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)