An Algorithm for Computing Lower Bounds for Unrestricted Black-Box Complexities.

Published in: GECCO (Companion) (2016)

Keyphrases

black box
dynamic programming
detection algorithm
objective function
learning algorithm
lower bound
similarity measure
np hard
optimal solution
linear programming
upper bound
k means
cost function
databases
search space
database systems
case study
probabilistic model
computational complexity
integration testing