Locating errors in faulty formulas

DOI10.1145/3313776MaRDI QIDQ4972679zbMATH OpenOpenAlexWikidataFDO

Authors Sampath Kannan, Kevin T. Tian

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

zbMATH Keywords

fault diagnosisfault-tolerant computinglearning

Mathematics Subject Classification ID

Networks and circuits as models of computation; circuit complexity (68Q06) Computational learning theory (68Q32) Fault detection; testing in circuits and networks (94C12)

Recommendations

• Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
• On unit diagnostic tests for constant faults of the same type at outputs of functional elements
• Conformance testing in the presence of multiple faults
• Single diagnostic tests for inversion faults of gates in circuits over arbitrary bases
• scientific article; zbMATH DE number 4211973

Cites work

• A theory of diagnosis from first principles
• A theory of the learnable
• Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
• Fault Tolerant Sorting Networks
• Learning Boolean read-once formulas over generalized bases
• Learning probabilistic read-once formulas on product distributions
• 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
• On the maximum tolerable noise of k-input gates for reliable computation by formulas
• Reliable computation by formulas in the presence of noise
• Reliable computation by networks in the presence of noise

This page was built for publication: Locating errors in faulty formulas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4972679)