An L(1/3) algorithm for ideal class group and regulator computation in certain number fields.
Jean-François BiassePublished in: Math. Comput. (2014)
Keyphrases
- computational complexity
- search space
- execution times
- cost function
- objective function
- segmentation algorithm
- improved algorithm
- dynamic programming
- learning algorithm
- np hard
- finite number
- computational cost
- preprocessing
- detection algorithm
- computational effort
- memory requirements
- single scan
- worst case
- small number
- optimization algorithm
- theoretical analysis
- times faster
- experimental evaluation
- multi class classification
- convergence rate
- probabilistic model
- space complexity
- significant improvement
- k means