Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation.
Gavin HarrisonJeremy R. JohnsonB. David SaundersPublished in: CoRR (2014)
Keyphrases
- dynamic programming
- optimization algorithm
- worst case
- search space
- experimental evaluation
- probabilistic model
- cost function
- computational cost
- segmentation algorithm
- em algorithm
- high accuracy
- k means
- improved algorithm
- linear programming
- particle swarm optimization
- computational complexity
- computationally efficient
- learning algorithm
- context free parsing
- clustering method
- detection algorithm
- efficient computation
- theoretical analysis
- lower bound
- data analysis
- objective function
- reinforcement learning