Lower bound on the running time of Pop-Stack Sorting on a random permutation.
Lyuben LichevPublished in: CoRR (2022)
Keyphrases
- lower bound
- upper bound
- random instances
- lower and upper bounds
- branch and bound
- branch and bound algorithm
- optimal solution
- np hard
- objective function
- worst case
- data sets
- lower bounding
- constant factor
- uniformly distributed
- upper and lower bounds
- linear programming relaxation
- database
- sorting algorithms
- randomly generated
- linear programming
- query processing
- bayesian networks
- information systems
- learning algorithm