A Modular Algorithm for Computing Polynomial GCDs over Number Fields presented with Multiple Extensions.
Mark van HoeijMichael B. MonaganPublished in: CoRR (2016)
Keyphrases
- computational complexity
- experimental evaluation
- learning algorithm
- space complexity
- optimal solution
- computational effort
- improved algorithm
- computationally efficient
- preprocessing
- dynamic programming
- convex hull
- times faster
- worst case
- high accuracy
- detection algorithm
- optimization algorithm
- execution times
- polynomially bounded
- memory requirements
- tree structure
- theoretical analysis
- expectation maximization
- small number
- probabilistic model
- computational cost
- k means
- simulated annealing
- support vector machine
- np hard
- cost function
- undirected graph
- lower bound
- objective function