Factoring High-Degree Polynomials by the Black Box Berlekamp Algorithm.
Erich KaltofenAustin LoboPublished in: ISSAC (1994)
Keyphrases
- black box
- recognition algorithm
- detection algorithm
- high accuracy
- learning algorithm
- worst case
- cost function
- computational cost
- dynamic programming
- matching algorithm
- optimization algorithm
- computational complexity
- optimal solution
- simulated annealing
- convergence rate
- particle swarm optimization
- case study
- similarity measure
- test cases
- objective function
- expectation maximization
- preprocessing
- np hard
- lower bound