Lower bound for non-adaptive estimation of the number of defective items

Nader H. Bshouty

doi:https://doi.org/10.4230/LIPIcs.ISAAC.2019.2

Lower bound for non-adaptive estimation of the number of defective items

Nader H. Bshouty

Computer Science

Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We prove that to estimate within a constant factor the number of defective items in a non-adaptive randomized group testing algorithm we need at least Ω(log n) tests. This solves the open problem posed by Damaschke and Sheikh Muhammad in [6, 7].

Original language	English
Title of host publication	30th International Symposium on Algorithms and Computation, ISAAC 2019
Editors	Pinyan Lu, Guochuan Zhang
ISBN (Electronic)	9783959771306
DOIs	https://doi.org/10.4230/LIPIcs.ISAAC.2019.2
State	Published - Dec 2019
Event	30th International Symposium on Algorithms and Computation, ISAAC 2019 - Shanghai, China Duration: 8 Dec 2019 → 11 Dec 2019

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	149

Conference

Conference	30th International Symposium on Algorithms and Computation, ISAAC 2019
Country/Territory	China
City	Shanghai
Period	8/12/19 → 11/12/19

Keywords

Defective Items
Estimation
Group Testing

All Science Journal Classification (ASJC) codes

Software

Access to Document

https://doi.org/10.4230/LIPIcs.ISAAC.2019.2

Cite this

@inproceedings{e63e2eb09ac24856b3dcf1f860260b92,

title = "Lower bound for non-adaptive estimation of the number of defective items",

abstract = "We prove that to estimate within a constant factor the number of defective items in a non-adaptive randomized group testing algorithm we need at least Ω(log n) tests. This solves the open problem posed by Damaschke and Sheikh Muhammad in [6, 7].",

keywords = "Defective Items, Estimation, Group Testing",

author = "Bshouty, {Nader H.}",

note = "Publisher Copyright: {\textcopyright} Nader H. Bshouty; licensed under Creative Commons License CC-BY; 30th International Symposium on Algorithms and Computation, ISAAC 2019 ; Conference date: 08-12-2019 Through 11-12-2019",

year = "2019",

month = dec,

doi = "https://doi.org/10.4230/LIPIcs.ISAAC.2019.2",

language = "الإنجليزيّة",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

editor = "Pinyan Lu and Guochuan Zhang",

booktitle = "30th International Symposium on Algorithms and Computation, ISAAC 2019",

}

Bshouty, NH 2019, Lower bound for non-adaptive estimation of the number of defective items. in P Lu & G Zhang (eds), 30th International Symposium on Algorithms and Computation, ISAAC 2019., 2, Leibniz International Proceedings in Informatics, LIPIcs, vol. 149, 30th International Symposium on Algorithms and Computation, ISAAC 2019, Shanghai, China, 8/12/19. https://doi.org/10.4230/LIPIcs.ISAAC.2019.2

Lower bound for non-adaptive estimation of the number of defective items. / Bshouty, Nader H.
30th International Symposium on Algorithms and Computation, ISAAC 2019. ed. / Pinyan Lu; Guochuan Zhang. 2019. 2 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 149).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Lower bound for non-adaptive estimation of the number of defective items

AU - Bshouty, Nader H.

PY - 2019/12

Y1 - 2019/12

N2 - We prove that to estimate within a constant factor the number of defective items in a non-adaptive randomized group testing algorithm we need at least Ω(log n) tests. This solves the open problem posed by Damaschke and Sheikh Muhammad in [6, 7].

AB - We prove that to estimate within a constant factor the number of defective items in a non-adaptive randomized group testing algorithm we need at least Ω(log n) tests. This solves the open problem posed by Damaschke and Sheikh Muhammad in [6, 7].

KW - Defective Items

KW - Estimation

KW - Group Testing

UR - http://www.scopus.com/inward/record.url?scp=85076380969&partnerID=8YFLogxK

U2 - https://doi.org/10.4230/LIPIcs.ISAAC.2019.2

DO - https://doi.org/10.4230/LIPIcs.ISAAC.2019.2

M3 - منشور من مؤتمر

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 30th International Symposium on Algorithms and Computation, ISAAC 2019

A2 - Lu, Pinyan

A2 - Zhang, Guochuan

T2 - 30th International Symposium on Algorithms and Computation, ISAAC 2019

Y2 - 8 December 2019 through 11 December 2019

ER -

Lower bound for non-adaptive estimation of the number of defective items

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this