Minimal Complementation Below Uniform Upper Bounds for the Arithmetical Degrees.
Masahiro KumabePublished in: J. Symb. Log. (1996)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- tight bounds
- lower and upper bounds
- sample complexity
- branch and bound algorithm
- worst case
- efficiently computable
- upper bounding
- linear array
- scheduling problem
- special case
- branch and bound
- evolutionary algorithm
- search algorithm
- database systems
- decision trees
- neural network
- databases
- real time
- database