On a lower bound for the redundancy of reliable networks with noisy gates.
Nicholas PippengerGeorge D. StamoulisJohn N. TsitsiklisPublished in: IEEE Trans. Inf. Theory (1991)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- optimal solution
- np hard
- branch and bound
- objective function
- cost effective
- network analysis
- complex systems
- network size
- noisy data
- complex networks
- sufficiently accurate
- competitive ratio
- heterogeneous networks
- lower and upper bounds
- community structure
- high quality
- missing data
- bayesian networks