A Lower Bound for the Complexity of the Union-Split-Find Problem.
Kurt MehlhornStefan NäherHelmut AltPublished in: ICALP (1987)
Keyphrases
- lower bound
- worst case
- upper bound
- objective function
- average case complexity
- np hard
- branch and bound
- complexity analysis
- neural network
- artificial intelligence
- branch and bound algorithm
- lower and upper bounds
- computational complexity
- data structure
- query processing
- reinforcement learning
- bayesian networks
- simulated annealing
- decision problems
- learning theory
- upper and lower bounds