Infinite sets that admit fast exhaustive search.

Martín Hötzel Escardó

Published in: LICS (2007)

Keyphrases

exhaustive search
computational complexity
dynamic programming
solution space
brute force
nearest neighbor search
computationally feasible
lower bound
simulated annealing
finite sets
databases
search space
computationally expensive
evolutionary algorithm
optimal solution
real numbers
learning algorithm
data mining