Locating Errors in Faulty Formulas
From MaRDI portal
Publication:4972679
DOI10.1145/3313776zbMath1454.68049OpenAlexW2953097310WikidataQ127775286 ScholiaQ127775286MaRDI QIDQ4972679
Publication date: 25 November 2019
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3313776
Computational learning theory (68Q32) Fault detection; testing in circuits and networks (94C12) Networks and circuits as models of computation; circuit complexity (68Q06)
Cites Work
- A theory of diagnosis from first principles
- Learning probabilistic read-once formulas on product distributions
- Learning Boolean read-once formulas over generalized bases
- Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
- On the maximum tolerable noise of k-input gates for reliable computation by formulas
- A theory of the learnable
- Reliable computation by formulas in the presence of noise
- Reliable computation by networks in the presence of noise
- Fault Tolerant Sorting Networks
- Learning read-once formulas with queries
- Lower bounds for the complexity of reliable Boolean circuits with noisy gates
- On the maximum tolerable noise for reliable computation by formulas
This page was built for publication: Locating Errors in Faulty Formulas
