Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation

DOI10.1007/978-3-642-45278-9_40zbMath1408.68146arXiv1303.5862OpenAlexW2168849190MaRDI QIDQ2870055

Volkmar Sauerland, Mourad El Ouali

Publication date: 17 January 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Approximation algorithms (68W25) Combinatorial games (91A46)

Related Items (4)

On the query complexity of black-peg AB-mastermind ⋮ Query complexity of mastermind variants ⋮ The exact query complexity of yes-no permutation mastermind ⋮ The worst case number of questions in generalized AB game with and without white-peg answers

This page was built for publication: Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation