The average complexity of a coin-weighing problem

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199608/09)9:1/2<1::AID-RSA1>3.0.CO;2-0" /><1::AID-RSA1>3.0.CO;2-0 10.1002/(SICI)1098-2418(199608/09)9:1/2<1::AID-RSA1>3.0.CO;2-0zbMath0856.68070OpenAlexW2032903176MaRDI QIDQ4894598

René Schott, Philippe Chassaing, Laurent Alonso

Publication date: 7 October 1996

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199608/09)9:1/2<1::aid-rsa1>3.0.co;2-0

zbMATH Keywords

martingaleaverage complexityquasi-optimal algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (1)

Determining the majority: The biased case

This page was built for publication: The average complexity of a coin-weighing problem