A polynomial-time algorithm for computing absolutely normal numbers.
Verónica BecherPablo Ariel HeiberTheodore A. SlamanPublished in: Inf. Comput. (2013)
Keyphrases
- dynamic programming
- np hard
- computational complexity
- learning algorithm
- improved algorithm
- objective function
- recognition algorithm
- matching algorithm
- times faster
- k means
- worst case
- optimization algorithm
- convergence rate
- cost function
- search space
- preprocessing
- tree structure
- detection algorithm
- space complexity
- high accuracy
- probabilistic model
- optimal solution
- segmentation algorithm
- theoretical analysis
- expectation maximization
- input data
- simulated annealing
- bayesian networks
- data sets