English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Black-box Complexities of Combinatorial Problems

MPS-Authors
/persons/resource/persons44338

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

/persons/resource/persons44908

Lengler,  Johannes
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44814

Kötzing,  Timo
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45750

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

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Doerr, B., Lengler, J., Kötzing, T., & Winzen, C. (2011). Black-box Complexities of Combinatorial Problems. In N. Krasnogor, & P. L. Lanzi (Eds.), GECCO 2011 (pp. 981-988). New York, NY: ACM. doi:10.1145/2001576.2001710.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0010-11FF-6
Abstract
There is no abstract available