The Threat of a Deterministic Polynomial Time Algorithm for Primality Testing in Applied Cryptography.
Charlie ObimboStephen DoxseePublished in: MSV/AMCS (2004)
Keyphrases
- computational complexity
- detection algorithm
- optimization algorithm
- dynamic programming
- times faster
- cost function
- matching algorithm
- preprocessing
- special case
- computational cost
- high accuracy
- learning algorithm
- improved algorithm
- theoretical analysis
- input data
- worst case
- experimental evaluation
- np hard
- k means
- neural network
- probabilistic model
- simulated annealing
- significant improvement
- objective function
- bayesian networks
- randomized algorithm