Optimal Parallel Selection has Complexity O(Log Log n).
Miklós AjtaiJános KomlósWilliam L. SteigerEndre SzemerédiPublished in: J. Comput. Syst. Sci. (1989)
Keyphrases
- worst case
- optimal control
- case study
- parallel processing
- optimal selection
- parallel implementation
- space complexity
- databases
- lower bound
- dynamic programming
- parallel programming
- information retrieval
- special case
- np hard
- computational complexity
- upper bound
- optimal solution
- decision problems
- closed form
- database systems
- selection algorithm
- decision trees
- knowledge base
- artificial intelligence
- massively parallel
- optimal design
- learning algorithm