Black-box complexity: advantages of memory usage (Q264203)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Black-box complexity: advantages of memory usage	scientific article

Statements

scholarly article

Black-box complexity: advantages of memory usage (English)

Information Processing Letters

publication date

6 April 2016

zbMATH Keywords

analysis of algorithms

computational complexity

randomized algorithms

theory of computation

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.ipl.2016.01.009

Playing mastermind with constant-size memory

Ranking-based black-box complexity

Upper and lower bounds for randomized search heuristics in black-box optimization

On the Black-Box Complexity of Example Functions

Black-box search by unbiased variation

Real royal road functions for constant population size

Complexity Theory

Identifiers

zbMATH Open document ID

Mathematics Subject Classification ID

zbMATH DE Number

10.1016/J.IPL.2016.01.009

Sitelinks

Mathematics(1 entry)

mardi Publication:264203

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q264203&oldid=38285092"