The unbiased black-box complexity of partition is polynomial

DOI10.1016/J.ARTINT.2014.07.009zbMATH Open1405.68324OpenAlexW2048277430MaRDI QIDQ460634FDOQ460634

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

Recommendations

• The complexity of partition functions
• Automata, Languages and Programming
• scientific article
• On the complexity of some partition problems
• A note on the complexity of a partition algorithm
• On the computational complexity of (O,P)-partition problems
• Parameterized complexity of satisfactory partition problem
• Parameterized complexity of satisfactory partition problem
• The black-box query complexity of polynomial summation
• Computing and Combinatorics

zbMATH Keywords

heuristic searchevolutionary computationrun-time analysis

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Unbiasedness of estimation-of-distribution algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q460634)