On the Complexity of the F5 Gröbner basis Algorithm.
Magali BardetJean-Charles FaugèreBruno SalvyPublished in: CoRR (2013)
Keyphrases
- computational complexity
- worst case
- space complexity
- detection algorithm
- improved algorithm
- computational cost
- k means
- objective function
- dynamic programming
- cost function
- preprocessing
- optimal solution
- convergence rate
- times faster
- optimization algorithm
- learning algorithm
- recognition algorithm
- numerically stable
- theoretical analysis
- np hard
- significant improvement
- computationally efficient
- classification algorithm
- expectation maximization
- particle swarm optimization
- simulated annealing
- least squares
- constrained optimization