13 citations · 32 across the 25 of their papers we have counts for
5 papers · 2 filters
A Tight Lower Bound of for the Estimation of the Number of Defective Items
Nader H. Bshouty, Gergely Harcos
Let be a set of items of size , which may contain some defective items denoted by , where . In group testing, a {\it test} refers to a subset of items $Q…
Improved Lower Bound for Estimating the Number of Defective Items
Nader H. Bshouty
Let be a set of items of size that contains some defective items, denoted by , where . In group testing, a {\it test} refers to a subset of items $Q \subs…
On Detecting Some Defective Items in Group Testing
Nader H. Bshouty, Catherine A. Haddad-Zaknoon
Group testing is an approach aimed at identifying up to defective items among a total of elements. This is accomplished by examining subsets to determine if at least one de…
Superpolynomial Lower Bounds for Learning Monotone Classes
Nader H. Bshouty
Koch, Strassle, and Tan [SODA 2023], show that, under the randomized exponential time hypothesis, there is no distribution-free PAC-learning algorithm that runs in time $n^{\tilde…
A Note on Property Testing of the Binary Rank
Nader H. Bshouty
Let be a -matrix. We define the -binary rank, , of to be the minimal integer such that there are monochromatic rectangles that cover…