Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm.
Jean BerstelLuc BoassonOlivier CartonPublished in: Theor. Comput. Sci. (2009)
Keyphrases
- worst case
- np hard
- detection algorithm
- experimental evaluation
- objective function
- optimal solution
- optimization algorithm
- theoretical analysis
- learning algorithm
- average case
- improved algorithm
- particle swarm optimization
- computationally efficient
- k means
- expectation maximization
- high accuracy
- computational cost
- dynamic programming
- greedy algorithm
- upper bound
- segmentation algorithm
- multi objective
- space complexity
- perceptron algorithm