A polynomial time algorithm for computing the HNF of a module over the integers of a number field.
Jean-François BiasseClaus FiekerPublished in: ISSAC (2012)
Keyphrases
- computational complexity
- cost function
- times faster
- k means
- learning algorithm
- computational effort
- significant improvement
- polynomial time complexity
- experimental evaluation
- theoretical analysis
- preprocessing
- randomized algorithm
- probabilistic model
- search space
- high accuracy
- optimization algorithm
- execution times
- input data
- dynamic programming
- np hard
- special case
- real numbers
- constant factor
- cluster centers
- recognition algorithm
- strongly polynomial
- memory requirements
- tree structure
- clustering method
- detection algorithm
- segmentation algorithm
- simulated annealing
- small number
- computational cost
- objective function
- decision trees