A Polynomial-Time Algorithm for Solving the Hidden Subset Sum Problem.
Jean-Sébastien CoronAgnese GiniPublished in: CRYPTO (2) (2020)
Keyphrases
- worst case
- computational complexity
- computational cost
- high accuracy
- cost function
- experimental evaluation
- learning algorithm
- significant improvement
- recognition algorithm
- theoretical analysis
- greedy algorithms
- k means
- strongly polynomial
- search space
- optimal solution
- detection algorithm
- improved algorithm
- times faster
- convergence rate
- gradient projection
- primal dual
- np complete
- approximation algorithms
- clustering method
- segmentation algorithm
- simulated annealing
- np hard
- similarity measure