Complexity of realization of Boolean functions with small number of unit values by selfcorrecting contact circuits

DOI10.3103/S0027132211010037zbMath1304.94138MaRDI QIDQ2513187

Nikolay P. Red'kin

Publication date: 2 February 2015

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

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12) Boolean functions (94D10)

Related Items (1)

On self-correcting logic circuits of unreliable gates

Cites Work

• Reliable circuits using less reliable relays
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of realization of Boolean functions with small number of unit values by selfcorrecting contact circuits