On the synthesis of self-correcting schemes from functional elements with a small number of reliable elements

DOI10.1007/BF01152835zbMath0328.94036MaRDI QIDQ1226990

D. Uhlig

Publication date: 1974

Published in: Mathematical Notes (Search for Journal in Brave)

Mathematics Subject Classification ID

Related Items

\(\text{PI}_ k\) mass production and an optimal circuit for the Nečiporuk slice ⋮ Geometric arguments yield better bounds for threshold circuits and distributed computing ⋮ The choice and agreement problems of a random function ⋮ On the complexity of 2-output Boolean networks ⋮ On the computational power of probabilistic and faulty neural networks ⋮ On self-correcting logic circuits of unreliable gates ⋮ The direct sum of universal relations ⋮ Choosing, agreeing, and eliminating in communication complexity ⋮ Minimal polynomials for the conjunction of functions on disjoint variables can be very simple ⋮ Stochastic analog networks and computational complexity ⋮ On self-correcting logic circuits of unreliable gates with at most two inputs

Cites Work

• Unnamed Item