English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Black-box Complexities of Combinatorial Problems

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.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Doerr, Benjamin1, Author           
Lengler, Johannes1, Author           
Kötzing, Timo1, Author           
Winzen, Carola1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20112011
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 618690
DOI: 10.1145/2001576.2001710
URI: http://dx.doi.org/10.1145/2001576.2001710
Other: Local-ID: C1256428004B93B8-D3DF5AF59EF3758DC125793D002CEC0E-DoerrLKW11
 Degree: -

Event

show
hide
Title: 2011 Genetic and Evolutionary Computation Conference
Place of Event: Dublin, Ireland
Start-/End Date: 2011-07-12 - 2011-07-16

Legal Case

show

Project information

show

Source 1

show
hide
Title: GECCO 2011
  Abbreviation : GECCO 2011
  Subtitle : Genetic and Evolutionary Computation Conference
Source Genre: Proceedings
 Creator(s):
Krasnogor, Natalio1, Editor
Lanzi, Pier Luca1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 981 - 988 Identifier: ISBN: 978-1-4503-0557-0