On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements
From MaRDI portal
Publication:1226990
DOI10.1007/BF01152835zbMath0328.94036MaRDI QIDQ1226990
Publication date: 1974
Published in: Mathematical Notes (Search for Journal in Brave)
Related Items
On the computational power of probabilistic and faulty neural networks, Choosing, agreeing, and eliminating in communication complexity, On the complexity of 2-output Boolean networks, Geometric arguments yield better bounds for threshold circuits and distributed computing, Stochastic analog networks and computational complexity, The choice and agreement problems of a random function, The direct sum of universal relations, Minimal polynomials for the conjunction of functions on disjoint variables can be very simple, \(\text{PI}_ k\) mass production and an optimal circuit for the Nečiporuk slice, On self-correcting logic circuits of unreliable gates with at most two inputs, On self-correcting logic circuits of unreliable gates
Cites Work