Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.
Iftach HaitnerJonathan J. HochOmer ReingoldGil SegevPublished in: Electron. Colloquium Comput. Complex. (2007)
Keyphrases
- lower bound
- worst case
- upper bound
- complexity analysis
- branch and bound
- branch and bound algorithm
- lower and upper bounds
- average case complexity
- np hard
- objective function
- upper and lower bounds
- optimal solution
- computer graphics
- space complexity
- average case
- lower bounding
- virtual reality
- decision problems
- dynamic environments
- computational complexity
- multi agent
- linear programming relaxation
- neural network