The Unbiased Black-box Complexity of Partition is Polynomial

Doerr, Benjamin; Doerr, Carola; Kötzing, Timo

doi:10.1016/j.artint.2014.07.009

Local TagsRelease HistoryDetailsSummary

The Unbiased Black-box Complexity of Partition is Polynomial

Doerr, B., Doerr, C., & Kötzing, T. (2014). The Unbiased Black-box Complexity of Partition is Polynomial. Artificial Intelligence, 216, 275-286. doi:10.1016/j.artint.2014.07.009.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-4264-2 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0024-427C-E

Genre: Journal Article

Files

show Files

Locators

show

hide

Locator:
Link (Any fulltext) Open Access status unknown

Description:
-

OA-Status:

Creators

show

hide

Creators:
Doerr, Benjamin¹, Author
Doerr, Carola¹, Author
Kötzing, Timo¹, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2014-07-30Date issued: 2014

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: DOI: 10.1016/j.artint.2014.07.009
BibTex Citekey: DoerrDK14

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Artificial Intelligence

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Amsterdam : Elsevier

Pages: - Volume / Issue: 216 Sequence Number: - Start / End Page: 275 - 286 Identifier: ISSN: 0004-3702
CoNE: https://pure.mpg.de/cone/journals/resource/954925382047