de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Black-Box Complexity: Breaking the O(n logn) Barrier of LeadingOnes

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44338

Doerr,  Benjamin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45750

Winzen,  Carola
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Doerr, B., & Winzen, C. (2012). Black-Box Complexity: Breaking the O(n logn) Barrier of LeadingOnes. In J.-K. Hao, P. Legrand, P. Collet, N. Monmarché, E. Lutton, & M. Schoenauer (Eds.), Artificial Evolution (pp. 205-216). Berlin: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-BC81-F
Abstract
There is no abstract available