A Super-Logarithmic Lower Bound for Hypercubic Sorting Networks.
C. Greg PlaxtonTorsten SuelPublished in: ICALP (1994)
Keyphrases
- lower bound
- worst case
- upper bound
- social networks
- branch and bound algorithm
- branch and bound
- objective function
- lower and upper bounds
- optimal solution
- upper and lower bounds
- network design
- lower bounding
- np hard
- search algorithm
- data structure
- real time
- database
- network size
- regret bounds
- heterogeneous networks
- network analysis
- computer networks
- complex networks