Lower Bounds on Lattice Enumeration with Extreme Pruning.
Yoshinori AonoPhong Q. NguyenTakenobu SeitoJunji ShikataPublished in: IACR Cryptol. ePrint Arch. (2018)
Keyphrases
- lower bound
- search space
- upper bound
- exhaustive search
- optimal solution
- branch and bound
- branch and bound algorithm
- worst case
- pruning method
- objective function
- lower and upper bounds
- upper and lower bounds
- np hard
- vc dimension
- lower bounding
- lattice structure
- pruning methods
- effective pruning
- tree pruning
- pruning algorithms
- optimal cost
- set of randomly generated instances
- randomly generated problems
- pruning algorithm
- quadratic assignment problem
- linear programming relaxation
- max sat