Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions.

Matthew J. Streeter

Published in: GECCO (2) (2004)

Keyphrases

space complexity
upper bound
worst case
lower bound
arc consistency
upper and lower bounds
branch and bound algorithm
space requirements
additively separable
sample complexity
objective function
search algorithm
multi agent systems
approximation algorithms
worst case time complexity