A simpler counterexample to a long-standing conjecture on the complexity of Bryant's apply algorithm.
Beate BolligPublished in: Inf. Process. Lett. (2014)
Keyphrases
- long standing
- worst case
- space complexity
- optimization algorithm
- learning algorithm
- computational cost
- computational complexity
- significant improvement
- experimental evaluation
- k means
- improved algorithm
- preprocessing
- np hard
- dynamic programming
- recognition algorithm
- simulated annealing
- high accuracy
- neural network
- complexity analysis
- optimal solution
- cost function
- objective function
- experimental study
- classification algorithm
- matching algorithm
- similarity measure
- multi objective
- high computational complexity
- artificial neural networks