A new competitive algorithm for the counterfeit coin problem
From MaRDI portal
Recommendations
Cited in
(16)- Some new results concerning three counterfeit coins problem
- Coins and cones
- A \((\log_ 2 3+{1\over 2})\)-competitive algorithm for the counterfeit coin problem
- Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs
- A \(\frac{3}{2}\log 3\)-competitive algorithm for the counterfeit coin problem
- Fast simulation of new coins from old
- Optimal search procedure on coin-weighing problem
- Searching for a counterfeit coin with two unreliable weighings
- Searching for two counterfeit coins with two-arms balance
- Randomized group testing for mutually obscuring defectives
- On Detecting Fake Coin Flip Sequences
- scientific article; zbMATH DE number 1159036 (Why is no real title available?)
- scientific article; zbMATH DE number 895369 (Why is no real title available?)
- Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness
- A 23 log 3-competitive algorithm for the counterfeit coin problem
- Searching for counterfeit coins
This page was built for publication: A new competitive algorithm for the counterfeit coin problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1334646)