Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms - Simplified Setting for Small Characteristic Finite Fields.
Antoine JouxCécile PierrotPublished in: ASIACRYPT (1) (2014)
Keyphrases
- computational complexity
- continuous domains
- data structure
- worst case
- computational cost
- optimization problems
- multiscale
- significant improvement
- computational efficiency
- special case
- translation invariant
- approximation algorithms
- orders of magnitude
- learning algorithm
- search algorithm
- image segmentation
- computer vision