Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non-adaptiveness

@article{Marco2013SearchingFA,
  title={Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non-adaptiveness},
  author={Gianluca De Marco and Dariusz R. Kowalski},
  journal={Random Struct. Algorithms},
  year={2013},
  volume={42},
  pages={97-109}
}
We are given n coins of which k are heavy (defective), while the remaining n − k are light (good). We know both the weight of the good coins and the weight of the defective ones. Therefore, if we weigh a subset Q ⊆ S with a spring scale, then the outcome will tell us exactly the number of defectives contained in Q. The problem, known as Counterfeit Coins problem, is to identify the set of defective coins by minimizing the number of weighings, also called queries. It is well known that (k logk+1… CONTINUE READING

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…