Toward a deterministic polynomial time algorithm with optimal additive query complexity.

Nader H. Bshouty Hanna Mazzawi

Published in: Theor. Comput. Sci. (2012)

Keyphrases

worst case
query complexity
optimal solution
computational complexity
learning algorithm
np hard
database
objective function
special case
np complete
computational efficiency