Lower bounds for the complexity of reliable Boolean circuits with noisy gates.

Péter Gács Anna Gál

Published in: IEEE Trans. Inf. Theory (1994)

Keyphrases

lower bound
worst case
upper bound
logic circuits
objective function
high speed
cost effective
real valued
decision problems
branch and bound algorithm
complexity measures
computational complexity
np hard
boolean functions
vc dimension
delay insensitive