Improved bounds on the AN-complexity of O(1)-linear functions.

Published in: Comput. Complex. (2022)

Keyphrases

linear functions
upper bound
worst case
boolean functions
function classes
lower bound
computational complexity
special case
maximum likelihood
knapsack problem
learning algorithm
dynamic programming
active learning
model selection
stereo matching
query processing
evolutionary algorithm
covering numbers