A Linear Lower Bound on the Unbounded Error Probabilistic Communication Complexity.
Jürgen ForsterPublished in: Computational Complexity Conference (2001)
Keyphrases
- lower bound
- linear complexity
- worst case
- error tolerance
- upper bound
- branch and bound algorithm
- branch and bound
- bayesian networks
- error bounds
- approximation error
- error rate
- probabilistic model
- minimum error
- objective function
- np hard
- uncertain data
- optimal solution
- linear systems
- average case complexity
- lower bounding
- approximation algorithms
- memory requirements
- closed form
- information sharing
- sample complexity
- generative model
- search algorithm
- boolean expressions
- expected error
- neural network
- sufficiently accurate