A Tight Lower Bound of Ω(log n) for the Estimation of the Number of Defective Items.

Nader H. Bshouty Gergely Harcos

Published in: CoRR (2023)

Keyphrases

lower bound
upper bound
worst case
constant factor
branch and bound algorithm
small number
similarity measure
computational complexity
real time
np hard
randomized algorithm
lower and upper bounds
branch and bound
objective function
information systems
information retrieval
neural network