A Nonlinear Lower Bound on the Practical Combinational Complexity.
Xaver GubásJuraj HromkovicJuraj WaczulíkPublished in: Theor. Comput. Sci. (1995)
Keyphrases
- lower bound
- upper bound
- worst case
- branch and bound algorithm
- complexity analysis
- branch and bound
- optimal solution
- average case complexity
- lower and upper bounds
- real world
- np hard
- practical application
- scheduling problem
- decision problems
- objective function
- data sets
- evolutionary algorithm
- data structure
- bayesian networks
- online algorithms
- logic circuits
- sufficiently accurate