A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks.
C. Greg PlaxtonTorsten SuelPublished in: Theory Comput. Syst. (2000)
Keyphrases
- lower bound
- upper bound
- np hard
- network structure
- objective function
- lower and upper bounds
- social networks
- sufficiently accurate
- branch and bound algorithm
- optimal solution
- complex networks
- worst case
- heterogeneous networks
- complex systems
- branch and bound
- network model
- sample complexity
- linear programming relaxation
- polynomial approximation
- genetic algorithm