The unbiased black-box complexity of partition is polynomial

DOI10.1016/j.artint.2014.07.009zbMath1405.68324OpenAlexW2048277430MaRDI QIDQ460634

Timo Kötzing, Benjamin Doerr, Carola Doerr

Publication date: 13 October 2014

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2014.07.009

zbMATH Keywords

evolutionary computationheuristic searchrun-time analysis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Unbiasedness of estimation-of-distribution algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ranking-based black-box complexity
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Analyzing evolutionary algorithms. The computer science perspective.
• Memory-restricted black-box complexity of OneMax
• Minimization algorithms and random walk on the d-cube
• The rate of convergence to optimality of the LPT rule
• Local optimization on graphs
• Lower bounds on the worst-case complexity of some oracle algorithms
• Oracles and queries that are sufficient for exact learning
• Black-box complexities of combinatorial problems
• Black-box search by unbiased variation
• Queries and concept learning
• Reducing the arity in unbiased black-box complexity
• Upper and lower bounds for randomized search heuristics in black-box optimization
• The Query Complexity of Finding a Hidden Permutation
• Reducibility among Combinatorial Problems
• Faster black-box algorithms through higher arity operators
• STACS 2005

This page was built for publication: The unbiased black-box complexity of partition is polynomial