Lower bounds for noisy Boolean decision trees

DOI10.1145/237814.238013MaRDI QIDQ4228519zbMATH OpenOpenAlexFDO

Authors

Publication date 1 March 1999

Published in Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/237814.238013

Mathematics Subject Classification ID

Recommendations

• Average-Case Lower Bounds for Noisy Boolean Decision Trees
• Computing with Noisy Information
• Lower Bounds for the Noisy Broadcast Problem
• Rounds vs queries trade-off in noisy computation
• scientific article; zbMATH DE number 5899292

Cited in

(5)

• Rounds vs queries trade-off in noisy computation
• Average-Case Lower Bounds for Noisy Boolean Decision Trees
• On boolean decision trees with faulty nodes
• Computing with Noisy Information
• Locating information with uncertainty in fully interconnected networks: The case of nondistributed memory

This page was built for publication: Lower bounds for noisy Boolean decision trees

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