Login / Signup
A Tight Lower Bound of Ω(log n) for the Estimation of the Number of Defective Items.
Nader H. Bshouty
Gergely Harcos
Published in:
Electron. Colloquium Comput. Complex. (2023)
Keyphrases
</>
lower bound
upper bound
worst case
branch and bound algorithm
small number
real time
decision trees
optimal solution
np hard
branch and bound
machine learning
information systems
bayesian networks
objective function
computational complexity
density estimation