A linear lower bound on the unbounded error probabilistic communication complexity.
Jürgen ForsterPublished in: J. Comput. Syst. Sci. (2002)
Keyphrases
- lower bound
- linear complexity
- upper bound
- worst case
- error tolerance
- objective function
- error bounds
- computational complexity
- approximation error
- branch and bound algorithm
- probabilistic model
- branch and bound
- average case complexity
- probabilistic logic
- optimal solution
- information sharing
- communication systems
- communication channels
- probabilistic reasoning
- linear systems
- error rate
- generalization error
- error analysis
- graphical models
- probability distribution
- np hard