Matthew J. Streeter. Upper Bounds on the Time and Space Complexity of Optimizing Additively Separable Functions. In Kalyanmoy Deb, Riccardo Poli, Wolfgang Banzhaf, Hans-Georg Beyer, Edmund K. Burke, Paul J. Darwen, Dipankar Dasgupta, Dario Floreano, James A. Foster, Mark Harman, Owen Holland, Pier Luca Lanzi, Lee Spector, Andrea Tettamanzi, Dirk Thierens, Andrew M. Tyrrell, editors, Genetic and Evolutionary Computation - GECCO 2004, Genetic and Evolutionary Computation Conference, Seattle, WA, USA, June 26-30, 2004, Proceedings, Part II. Volume 3103 of Lecture Notes in Computer Science, pages 186-197, Springer, 2004. [doi]
Abstract is missing.