Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation.
Gavin HarrisonJeremy R. JohnsonB. David SaundersPublished in: ACM Commun. Comput. Algebra (2013)
Keyphrases
- preprocessing
- learning algorithm
- computational cost
- k means
- probabilistic model
- times faster
- optimal solution
- computational complexity
- experimental evaluation
- dynamic programming
- np hard
- improved algorithm
- path planning
- optimization algorithm
- detection algorithm
- genetic algorithm
- polynomially bounded
- simulated annealing
- cost function
- search space
- objective function
- data sets
- maximum likelihood
- significant improvement
- clustering method
- recognition algorithm
- similarity measure
- efficient computation
- context free parsing