Lower Bounds on Lattice Enumeration with Extreme Pruning.
Yoshinori AonoPhong Q. NguyenTakenobu SeitoJunji ShikataPublished in: CRYPTO (2) (2018)
Keyphrases
- lower bound
- search space
- upper bound
- exhaustive search
- branch and bound
- optimal solution
- branch and bound algorithm
- lattice structure
- lower and upper bounds
- objective function
- vc dimension
- np hard
- worst case
- sample complexity
- tree pruning
- upper and lower bounds
- boolean algebra
- pruning algorithms
- pruning method
- computational complexity
- optimal cost
- effective pruning
- lattice points
- pruning methods
- concept lattice
- image registration
- dynamic programming
- special case
- search algorithm