The unbiased black-box complexity of partition is polynomial
type: Item
instance of: scholarly article
title: The unbiased black-box complexity of partition is polynomial
zbMATH Open document ID: 1405.68324
author: Benjamin Doerr
author: Timo Kötzing
author: Carola Doerr
published in: Artificial Intelligence
publication date: 2014-10-13T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6355004
zbMATH Keywords: heuristic search
zbMATH Keywords: run-time analysis
zbMATH Keywords: evolutionary computation
MaRDI profile type: Publication
full work available at URL: j.artint.2014.07.009
OpenAlex ID: W2048277430
cites work: The Query Complexity of Finding a Hidden Permutation
cites work: Minimization algorithms and random walk on the d-cube
cites work: Queries and concept learning
cites work: Q5306039
cites work: Oracles and queries that are sufficient for exact learning
cites work: Faster black-box algorithms through higher arity operators
cites work: Upper and lower bounds for randomized search heuristics in black-box optimization
cites work: Black-box complexities of combinatorial problems
cites work: Memory-restricted black-box complexity of OneMax
cites work: Ranking-based black-box complexity
cites work: Reducing the arity in unbiased black-box complexity
cites work: Q5731202
cites work: The rate of convergence to optimality of the LPT rule
cites work: Q4198056
cites work: Lower bounds on the worst-case complexity of some oracle algorithms
cites work: Q2701740
cites work: Analyzing evolutionary algorithms. The computer science perspective.
cites work: Reducibility among Combinatorial Problems
cites work: Local optimization on graphs
cites work: Black-box search by unbiased variation
cites work: Q3637028
cites work: Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
cites work: STACS 2005
DOI: 10.1016/J.ARTINT.2014.07.009
Recommended article: The complexity of partition functions
Recommended article: Automata, Languages and Programming
Recommended article: Q3188969
Recommended article: On the complexity of some partition problems
Recommended article: A note on the complexity of a partition algorithm
Recommended article: On the computational complexity of (O,P)-partition problems
Recommended article: Parameterized complexity of satisfactory partition problem
Recommended article: The black-box query complexity of polynomial summation
Recommended article: Computing and Combinatorics
description: scientific article; zbMATH DE number 6355004