Can large fanin circuits perform reliable computations in the presence of faults?
From MaRDI portal
Publication:1575437
DOI10.1016/S0304-3975(99)00237-6zbMath0945.68017MaRDI QIDQ1575437
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Cites Work
- Unnamed Item
- Unnamed Item
- Majority gates vs. general weighted threshold gates
- Threshold circuits of bounded depth
- Invariance of complexity measures for networks with unreliable gates
- Lower bounds for the complexity of reliable Boolean circuits with noisy gates
- Area efficient methods to increase the reliability of combinatorial circuits
- Simulating threshold circuits by majority circuits