Optimal schemes for combinatorial query problems with integer feedback

DOI10.5070/c63261997zbMath1530.91109arXiv2203.09496OpenAlexW4386744372MaRDI QIDQ6138906

Anders Martinsson

Publication date: 16 December 2023

Published in: Combinatorial Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2203.09496

zbMATH Keywords

combinatorial gamesquery complexitymastermindcoin-weighing

Mathematics Subject Classification ID

2-person games (91A05) Combinatorial games (91A46) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mastermind
• On the algorithmic complexity of the Mastermind game with black-peg results
• The number of pessimistic guesses in generalized black-peg mastermind
• On the metric dimension of Cartesian powers of a graph
• Playing Mastermind With Many Colors
• Coding for T-user multiple-access channels
• On a Combinatorial Problem in Number Theory
• Determination of a Subset from Certain Combinatorial Properties
• On Metric Generators of Graphs
• Optimal reconstruction of graphs under the additive model

This page was built for publication: Optimal schemes for combinatorial query problems with integer feedback