scientific article; zbMATH DE number 7650068

DOI10.4230/LIPIcs.APPROX-RANDOM.2019.1MaRDI QIDQ5875452

David P. Woodruff, Unnamed Author, Taisuke Yasuda

Publication date: 3 February 2023

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

query complexitymastermind\(l_p\) distance

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Mastermind
• Query complexity of mastermind variants
• The query complexity of a permutation-based variant of mastermind
• Playing Mastermind With Many Colors
• Volumes of Generalized Unit Balls

This page was built for publication: