Optimal Short-Circuit Resilient Formulas

DOI10.1145/3538390OpenAlexW4289753793WikidataQ113770055 ScholiaQ113770055MaRDI QIDQ5889787FDOQ5889787

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

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

zbMATH Keywords

circuit complexitycoding theoryKarchmer-Wigderson gamesinteractive codingnoise-resilient circuits

Mathematics Subject Classification ID

Computer science (68-XX)

Cited In (1)

• Title not available (Why is that?)

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)