Playing mastermind with constant-size memory (Q2254508): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2190644555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-box search by elimination of fitness functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mastermind / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounds for randomized search heuristics in black-box optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory-restricted black-box complexity of OneMax / rank
 
Normal rank
Property / cites work
 
Property / cites work: Playing Mastermind with Constant-size Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5731202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algorithmic complexity of the Mastermind game with black-peg results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of pessimistic guesses in generalized black-peg mastermind / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank

Latest revision as of 15:33, 9 July 2024

scientific article
Language Label Description Also known as
English
Playing mastermind with constant-size memory
scientific article

    Statements

    Identifiers