Pages that link to "Item:Q1356538"
From MaRDI portal
The following pages link to A \((\log_ 2 3+{1\over 2})\)-competitive algorithm for the counterfeit coin problem (Q1356538):
Displaying 6 items.
- Privacy and counterfeit coins (Q517889) (← links)
- A new competitive algorithm for the counterfeit coin problem (Q1334646) (← links)
- A \(\frac{3}{2}\log 3\)-competitive algorithm for the counterfeit coin problem (Q1391318) (← links)
- Partitions of \(n\) that avoid partitions of \(f\), and an application to the tiny-pan coin weighing problem (Q2400576) (← links)
- Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness (Q4903279) (← links)
- A 23 log 3-competitive algorithm for the counterfeit coin problem (Q6085738) (← links)
