A Polynomial-Time Algorithm for Solving the Hidden Subset Sum Problem.
Jean-Sébastien CoronAgnese GiniPublished in: IACR Cryptol. ePrint Arch. (2020)
Keyphrases
- computational complexity
- worst case
- detection algorithm
- high accuracy
- optimal solution
- preprocessing
- experimental evaluation
- learning algorithm
- optimization algorithm
- np hard
- k means
- dynamic programming
- cost function
- randomized algorithm
- multi objective
- gradient projection
- tree structure
- recognition algorithm
- approximation ratio
- greedy algorithms
- strongly polynomial
- quadratic programming
- combinatorial optimization
- matching algorithm
- input data
- linear programming
- computational cost
- search space
- similarity measure