"Black-box complexities of combinatorial problems."

Benjamin Doerr et al. (2013)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2012.10.039

access: open

type: Journal Article

metadata version: 2024-05-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/DoerrKLW13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/DoerrKLW13
Benjamin Doerr, Timo Kötzing, Johannes Lengler, Carola Winzen:
Black-box complexities of combinatorial problems. Theor. Comput. Sci. 471: 84-106 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.