Searching for Two Objects by Underweight Feedback

descriptionPublicationkeyboard_double_arrow_right Article 01 Feb 1988 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Discrete Mathematics, volume 1, pages 65-70 (issn: 0895-4801, eissn: 1095-7146,

Copyright policy )

Authors: Ker-I Ko;

doi: 10.1137/0401007

Searching for Two Objects by Underweight Feedback

- Summary
- Subjects
- Metrics

Abstract

Summary: A group testing problem with two irregular coins and with a test device that detects only an underweight coin is considered. The maximum number of tests required to identify two irregulars, one overweight and one underweight, is known to have a lower bound of 2 log n. We present a procedure that gives an upper bound of 2 log n\(+O(\log n \sqrt{\log n})\).

Keywords

searching, Analysis of algorithms and problem complexity, underweight feedback, upper bound, Searching and sorting, group testing

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	9
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average