Optimal Short-Circuit Resilient Formulas

DOI10.1145/3538390MaRDI QIDQ5889787zbMATH OpenOpenAlexWikidataFDO

Authors Mark Braverman, Klim Efremenko, Ran Gelles, Michael A. Yitayew

Publication date 27 April 2023

Published in Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

circuit complexitycoding theoryinteractive codingKarchmer-Wigderson gamesnoise-resilient circuits

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• scientific article; zbMATH DE number 7564410
• Reliable computation by formulas in the presence of noise
• On the maximum tolerable noise for reliable computation by formulas
• On the design of reliable Boolean circuits that contain partially unreliable gates
• On the maximum tolerable noise for reliable computation by formulas

Cited in

(1)

• scientific article; zbMATH DE number 7564410 (Why is no real title available?)

This page was built for publication: Optimal Short-Circuit Resilient Formulas

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