Login / Signup

A Lower Bound on the Complexity of the Union-Split-Find Problem.

Kurt MehlhornStefan NäherHelmut Alt
Published in: SIAM J. Comput. (1988)
Keyphrases
  • lower bound
  • upper bound
  • worst case
  • optimal solution
  • decision problems
  • branch and bound
  • database
  • branch and bound algorithm
  • complexity analysis
  • artificial intelligence