A new Modular Algorithm for Computation of Algebraic Number Polynomial Gcds.
Trevor J. SmedleyPublished in: ISSAC (1989)
Keyphrases
- computational complexity
- computational cost
- learning algorithm
- optimization algorithm
- np hard
- dynamic programming
- expectation maximization
- execution times
- recognition algorithm
- memory requirements
- tree structure
- theoretical analysis
- computationally efficient
- high accuracy
- objective function
- preprocessing
- worst case
- search space
- k means
- cost function
- experimental evaluation
- small number
- detection algorithm
- clustering method
- particle swarm optimization
- times faster
- convergence rate
- optimal solution
- improved algorithm
- space complexity
- initial set
- classification algorithm
- computational effort
- matching algorithm
- simulated annealing