A Tight Lower Bound for Randomized Synchronous Consensus.
Ziv Bar-JosephMichael Ben-OrPublished in: PODC (1998)
Keyphrases
- lower bound
- randomized algorithms
- upper bound
- randomized algorithm
- branch and bound algorithm
- branch and bound
- np hard
- worst case
- objective function
- optimal solution
- asynchronous communication
- lower and upper bounds
- neural network
- privacy preserving association rule mining
- lower bounding
- linear programming relaxation
- lagrangian relaxation
- constant factor
- branch and bound method
- directed networks
- vc dimension
- sample complexity
- data mining
- data sets