Computing Boolean functions from multiple faulty copies of input bits

DOI10.1007/3-540-45995-2_47MaRDI QIDQ3044354zbMATH OpenFDO

Authors Xiaomin Chen, Mario Szegedy

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2286/22860539.htm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Boolean programming (90C09) Fault detection; testing in circuits and networks (94C12)

Recommendations

• Computing Boolean functions from multiple faulty copies of input bits
• Lower bounds for the complexity of reliable Boolean circuits with noisy gates
• On boolean decision trees with faulty nodes
• ON EVALUATING BOOLEAN FUNCTIONS WITH UNRELIABLE TESTS
• Reliable computation by formulas in the presence of noise

Cited in

(4)

• Bit copying: the ultimate computational simplicity
• Evaluation of Boolean functions on noisy input
• ON EVALUATING BOOLEAN FUNCTIONS WITH UNRELIABLE TESTS
• Computing Boolean functions from multiple faulty copies of input bits

This page was built for publication: Computing Boolean functions from multiple faulty copies of input bits

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