DeepAI AI Chat
Log In Sign Up

Optimal Short-Circuit Resilient Formulas

by   Mark Braverman, et al.
Princeton University
Bar-Ilan University

We consider fault-tolerant boolean formulas in which the output of a faulty gate is short-circuited to one of the gate's inputs. A recent result by Kalai et al. (FOCS 2012) converts any boolean formula into a resilient formula of polynomial size that works correctly if less than a fraction 1/6 of the gates (on every input-to-output path) are faulty. We improve the result of Kalai et al., and show how to efficiently fortify any boolean formula against a fraction 1/5 of short-circuit gates per path, with only a polynomial blowup in size. We additionally show that it is impossible to obtain formulas with higher resilience and sub-exponential growth in size. Towards our results, we consider interactive coding schemes when noiseless feedback is present; these produce resilient boolean formulas via a Karchmer-Wigderson relation. We develop a coding scheme that resists up to a fraction 1/5 of corrupted transmissions in each direction of the interactive channel. We further show that such a level of noise is maximal for coding schemes with sub-exponential blowup in communication. Our coding scheme takes a surprising inspiration from Blockchain technology.


page 1

page 2

page 3

page 4


Interactive coding resilient to an unknown number of erasures

We consider distributed computations between two parties carried out ove...

Efficient Interactive Coding Achieving Optimal Error Resilience Over the Binary Channel

Given a noiseless protocol π_0 computing a function f(x, y) of Alice and...

On P Versus NP

I generalize a well-known result that P = NP fails for monotone polynomi...

Algorithms and Lower Bounds for de Morgan Formulas of Low-Communication Leaf Gates

The class FORMULA[s] ∘𝒢 consists of Boolean functions computable by size...

Teleportation-based quantum homomorphic encryption scheme with quasi-compactness and perfect security

This article defines encrypted gate, which is denoted by EG[U]:|α〉→((a,b...

Understanding the complexity of #SAT using knowledge compilation

Two main techniques have been used so far to solve the #P-hard problem #...

Towards Physarum Binary Adders

Plasmodium of Physarum polycephalum is a single cell visible by unaided ...