A Tighter Upper Bound on the Worst Case Behavior of Conway's Parallel Sorting Algorithm.
Alejandro A. SchäfferPublished in: J. Algorithms (1988)
Keyphrases
- worst case
- upper bound
- lower bound
- average case
- np hard
- optimal solution
- detection algorithm
- experimental evaluation
- times faster
- sorting algorithms
- error bounds
- parallel implementation
- learning algorithm
- dynamic programming
- running times
- computational complexity
- cost function
- upper and lower bounds
- k means
- lower and upper bounds
- preprocessing
- error probability
- convex hull
- optimization algorithm
- pilot study
- approximation algorithms
- high accuracy
- special case
- recognition algorithm
- hardware implementation
- clustering method
- multi class
- evolutionary algorithm
- constant factor
- objective function
- reinforcement learning