An Asymptotically Fast Probabilitstic Algorithm for Computing Polynominal GCD's over an Algebraic Number Field.
Lars LangemyrPublished in: AAECC (1990)
Keyphrases
- computational complexity
- experimental evaluation
- learning algorithm
- worst case
- preprocessing
- search space
- dynamic programming
- memory requirements
- times faster
- theoretical analysis
- k means
- execution times
- np hard
- probabilistic model
- simulated annealing
- computational effort
- detection algorithm
- optimization algorithm
- segmentation algorithm
- randomized algorithm
- computationally efficient
- computational cost
- cost function
- significant improvement
- optimal solution
- objective function
- np complete
- expectation maximization
- particle swarm optimization
- clustering method
- path planning
- improved algorithm
- space complexity
- genetic algorithm