The complexity of an optimal algorithm for the generalized tower of hanoi problem.
A. J. van ZantenPublished in: Int. J. Comput. Math. (1990)
Keyphrases
- worst case
- dynamic programming
- learning algorithm
- computational complexity
- optimal solution
- preprocessing
- space complexity
- recognition algorithm
- optimization algorithm
- computational cost
- linear complexity
- experimental evaluation
- matching algorithm
- computationally efficient
- expectation maximization
- exhaustive search
- optimal path
- np hard
- theoretical analysis
- linear programming
- convergence rate
- cost function
- piecewise linear
- objective function
- genetic algorithm
- segmentation algorithm
- detection algorithm
- tree structure
- scheduling problem
- times faster
- probabilistic model
- evolutionary algorithm
- mapping function