Searching for two counterfeit coins with two-arms balance
From MaRDI portal
Publication:2576348
Recommendations
Cites work
- scientific article; zbMATH DE number 4057247 (Why is no real title available?)
- scientific article; zbMATH DE number 41347 (Why is no real title available?)
- scientific article; zbMATH DE number 65702 (Why is no real title available?)
- A new competitive algorithm for the counterfeit coin problem
- A predetermined algorithm for detecting a counterfeit coin with a multi-arms balance
- An improved algorithm for quantitative group testing
- Coin-Weighing Problems
- Detection of a Defective Coin with Partial Weight Information
- Five counterfeit coins
- How to find many counterfeit coins?
- Modifications of Competitive Group Testing
- On the conjecture at two counterfeit coins
- On various versions of the defective coin problem
- Optimal Detection of Two Complementary Defectives
- Optimal Detection of Two Defectives with a Parity Check Device
- Optimal detection of a counterfeit coin with multi-arms balances
- Optimal detection of two counterfeit coins with two-arms balance.
- Randomized group testing for mutually obscuring defectives
- Search problems for two irregular coins with incomplete feedback: The underweight model
- Searching for Two Objects by Underweight Feedback
- The Counterfeit Coin Problem Revisited
- The complexity of parallel search
- Two counterfeit coins
Cited in
(8)- Optimal detection of two counterfeit coins with two-arms balance.
- Minimal average cost of searching for a counterfeit coin: restricted model
- Searching for two counterfeit coins
- Searching for a counterfeit coin with \(b\)-balance
- Quantum counterfeit coin problems
- Selecting two different defective coins
- On two counterfeit coins conjecture
- How to find many counterfeit coins?
This page was built for publication: Searching for two counterfeit coins with two-arms balance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576348)