A Simplified Derivation of Timing Complexity Lower Bounds for Sorting by Comparisons.
Michel P. SchellekensRachit AgarwalEmanuel M. PopoviciKa Lok ManPublished in: Nord. J. Comput. (2006)
Keyphrases
- lower bound
- worst case
- upper bound
- complexity measures
- objective function
- space complexity
- upper and lower bounds
- data sets
- average case complexity
- special case
- computational complexity
- computational cost
- evolutionary algorithm
- decision problems
- branch and bound
- branch and bound algorithm
- optimal solution
- complexity analysis