A Lower Bound on the Single-Operation Worst-Case Time Complexity of the Union-Find Problem on Intervals.

Norbert Blum Henning Rochow

Published in: Inf. Process. Lett. (1994)

Keyphrases

lower bound
worst case time complexity
upper bound
optimal solution
objective function
branch and bound algorithm
relational databases
worst case
branch and bound
lower and upper bounds
sample complexity
concept class
sufficiently accurate