Exponentially improved algorithms and lower bounds for testing signed majorities.

Dana Ron Rocco A. Servedio

Published in: Electron. Colloquium Comput. Complex. (2013)

Keyphrases

learning algorithm
lower bound
algorithms require
times faster
worst case
online algorithms
theoretical analysis
computationally efficient
objective function
upper bound
computational cost
optimization problems
np hard
computational complexity
data structure
upper and lower bounds
data sets