Good reduction of puiseux series and complexity of the Newton-Puiseux algorithm over finite fields.
Adrien PoteauxMarc RybowiczPublished in: ISSAC (2008)
Keyphrases
- computational complexity
- space complexity
- matching algorithm
- computational cost
- computationally efficient
- dynamic programming
- times faster
- cost function
- linear complexity
- preprocessing
- learning algorithm
- experimental evaluation
- optimal solution
- high accuracy
- worst case
- optimization algorithm
- expectation maximization
- simulated annealing
- k means
- search space
- selection algorithm
- high computational complexity
- convergence rate
- probabilistic model
- improved algorithm
- segmentation algorithm
- neural network
- np hard
- significant improvement
- clustering algorithm
- genetic algorithm