𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The average case complexity of the shift—Invariant problem

✍ Scribed by T. Z. Jiang; Arthur G. Werschulz


Book ID
105629232
Publisher
Springer
Year
1998
Tongue
English
Weight
257 KB
Volume
14
Category
Article
ISSN
1573-8175

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


The average complexity of a coin-weighin
✍ L. Alonso; P. Chassaing; R. Schott 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 511 KB

Given a set of n coins, some of them weighing H , the others weighing h , h < H , we prove that to determine the set of heavy coins, an optimal algorithm requires an average of probabilities of being light and heavy. A simple quasi-optimal algorithm is described. Similar results are derived for th