A Lower Bound for Byzantine Agreement and Consensus for Adaptive Adversaries using VDFs.
Thaddeus DryjaQuanquan C. LiuNeha NarulaPublished in: CoRR (2020)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- objective function
- fault tolerant
- neural network
- optimal solution
- np hard
- upper and lower bounds
- branch and bound
- sufficiently accurate
- lower bounding
- linear programming relaxation
- adaptive systems
- data driven
- multi agent systems
- search algorithm
- decision trees
- e learning
- genetic algorithm