Reliable computation by formulas in the presence of noise
From MaRDI portal
Publication:3798602
Recommendations
Cited in
(26)- scientific article; zbMATH DE number 4110630 (Why is no real title available?)
- Fault tolerance in cellular automata at high fault rates
- Lower bounds for the complexity of reliable Boolean circuits with noisy gates
- Optimal Short-Circuit Resilient Formulas
- An Approximation Formula for a Class of Fault-Tolerant Computers
- Signal propagation and noisy circuits
- Computing Boolean functions from multiple faulty copies of input bits
- Evaluation of Boolean functions on noisy input
- Reliable Computations Based on Locally Decodable Codes
- scientific article; zbMATH DE number 2086255 (Why is no real title available?)
- Noise Threshold for Universality of Two-Input Gates
- On the computational power of probabilistic and faulty neural networks
- Reliable computation by networks in the presence of noise
- Stochastic analog networks and computational complexity
- A Turing machine resisting isolated bursts of faults
- A Turing machine resisting isolated bursts of faults
- Locating errors in faulty formulas
- On Reliable Computation by Noisy Random Boolean Formulas
- Broadcasting on trees and the Ising model.
- On the effects of noise and speed on computations
- scientific article; zbMATH DE number 3918274 (Why is no real title available?)
- scientific article; zbMATH DE number 3322469 (Why is no real title available?)
- Making polynomials robust to noise
- On the design of reliable Boolean circuits that contain partially unreliable gates
- On the maximum tolerable noise for reliable computation by formulas
- scientific article; zbMATH DE number 3972188 (Why is no real title available?)
This page was built for publication: Reliable computation by formulas in the presence of noise
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798602)
