Pages that link to "Item:Q1334646"
From MaRDI portal
The following pages link to A new competitive algorithm for the counterfeit coin problem (Q1334646):
Displaying 14 items.
- Randomized group testing for mutually obscuring defectives (Q293335) (← links)
- Searching for counterfeit coins (Q675884) (← links)
- Some new results concerning three counterfeit coins problem (Q1314330) (← links)
- Coins and cones (Q1356015) (← links)
- A \((\log_ 2 3+{1\over 2})\)-competitive algorithm for the counterfeit coin problem (Q1356538) (← links)
- Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs (Q1369687) (← links)
- A \(\frac{3}{2}\log 3\)-competitive algorithm for the counterfeit coin problem (Q1391318) (← links)
- Fast simulation of new coins from old (Q1774211) (← links)
- Optimal search procedure on coin-weighing problem (Q2507901) (← links)
- Searching for a counterfeit coin with two unreliable weighings (Q2565856) (← links)
- Searching for two counterfeit coins with two-arms balance (Q2576348) (← links)
- On Detecting Fake Coin Flip Sequences (Q3626702) (← 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)
