A Lower Bound for Probabilistic Distributed Algorithms.
Jan K. PachlPublished in: J. Algorithms (1987)
Keyphrases
- lower bound
- bayesian networks
- machine learning algorithms
- optimal solution
- computationally efficient
- search algorithm
- learning algorithm
- worst case
- computational cost
- branch and bound
- generative model
- distributed systems
- optimization problems
- np hard
- computational complexity
- data structure
- multi agent
- orders of magnitude
- reinforcement learning
- exact and approximate
- probabilistic approaches