A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Grzegorz HermanMichael SoltysPublished in: CoRR (2008)
Keyphrases
- k means
- learning algorithm
- matching algorithm
- experimental evaluation
- preprocessing
- objective function
- computational complexity
- np hard
- high accuracy
- dynamic programming
- cost function
- times faster
- provably correct
- convergence rate
- detection algorithm
- simulated annealing
- worst case
- data sets
- bayesian networks
- neural network
- particle swarm optimization
- expectation maximization
- computationally efficient
- theoretical analysis
- probabilistic model
- clustering method
- classification algorithm
- computational cost
- search space
- memory requirements
- single pass