On the complexity of the Lickteig-Roy subresultant algorithm.
Grégoire LecerfPublished in: J. Symb. Comput. (2019)
Keyphrases
- worst case
- learning algorithm
- computational cost
- dynamic programming
- objective function
- computational complexity
- linear complexity
- experimental study
- detection algorithm
- optimization algorithm
- computationally efficient
- high accuracy
- np hard
- cost function
- k means
- experimental evaluation
- input data
- single pass
- space complexity
- improved algorithm
- particle swarm optimization
- segmentation algorithm
- classification algorithm
- times faster
- recognition algorithm
- polynomial time complexity
- search space
- estimation algorithm
- memory requirements
- convex hull
- significant improvement
- theoretical analysis
- expectation maximization
- linear programming