A polynomial time algorithm for computing the HNF of a module over the integers of a number field
Jean-François BiasseClaus FiekerPublished in: CoRR (2012)
Keyphrases
- computational complexity
- detection algorithm
- execution times
- memory requirements
- worst case
- space complexity
- computational effort
- times faster
- cost function
- high accuracy
- objective function
- learning algorithm
- computational cost
- k means
- optimization algorithm
- convex hull
- polynomial time complexity
- randomized algorithm
- significant improvement
- special case
- np hard
- theoretical analysis
- dynamic programming
- small number
- recognition algorithm
- optimal solution
- experimental evaluation
- single scan
- probabilistic model