Formulas Resilient to Short-Circuit Errors
Foundations of Computer Science, 2012, Pages 490-499.
Boolean functionscircuit complexitydirected graphsformal languagesprotocolsMore(8+)
We show how to efficiently convert any boolean formula F into a boolean formula E that is resilient to short-circuit errors (as introduced by Kleitman et al. [KLM94]). A gate has a short-circuit error when the value it computes is replaced by the value of one of its inputs. We guarantee that E computes the same function as F, as long as a...More
Full Text (Upload PDF)