Lower Bounds for Coin-Weighing Problems

DOI10.1145/1944857.1944858zbMath1322.68090OpenAlexW2045587663MaRDI QIDQ2947551

Eric Purdy

Publication date: 24 September 2015

Published in: ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1944857.1944858

zbMATH Keywords

coin-weighing problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Partitions of \(n\) that avoid partitions of \(f\), and an application to the tiny-pan coin weighing problem

This page was built for publication: Lower Bounds for Coin-Weighing Problems