On the number of queries necessary to identify a permutation

DOI10.1016/0196-6774(86)90013-1zbMath0631.68059OpenAlexW2061014674MaRDI QIDQ3768415

Shia-Chung Teng, Ker-I. Ko

Publication date: 1986

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(86)90013-1

zbMATH Keywords

polynomial-time algorithmsearchingminimum number of queries required to identify an unknown permutationsize of the search spacetwo-person query game

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) 2-person games (91A05) Permutations, words, matrices (05A05)

Related Items (8)

Strategy optimization for deductive games ⋮ On the query complexity of black-peg AB-mastermind ⋮ Query complexity of mastermind variants ⋮ Some Completeness Results on Decision Trees and Group Testing ⋮ The exact query complexity of yes-no permutation mastermind ⋮ Bounds for the static permutation mastermind game ⋮ In Memoriam: Ker-I Ko (1950–2018) ⋮ The worst case number of questions in generalized AB game with and without white-peg answers

This page was built for publication: On the number of queries necessary to identify a permutation