The Query Complexity of a Permutation-Based Variant of Mastermind

Discrete Applied Mathematics, pp. 28-50, 2019.

Cited by: 7|Views52


We study the query complexity of a permutation-based variant of the guessing game Mastermind. In this variant, the secret is a pair (z,π) which consists of a binary string z∈{0,1}n and a permutation π of [n]. The secret must be unveiled by asking queries of the form x∈{0,1}n. For each such query, we are returned the score fz,π(x)≔max{i∈[0...More



Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.


Upload a single paper

for 5 coins

Wechat's Red Packet

Upload 50 articles

for 250 coins

Wechat's Red Packet

Upload 200 articles

for 1000 coins

Wechat's Red Packet

Upload 500 articles

for 2500 coins

Wechat's Red Packet

Upload 1000 articles

for 5000 coins

Wechat's Red Packet
Your rating :