Login / Signup

Exponentially Improved Algorithms and Lower Bounds for Testing Signed Majorities.

Dana RonRocco A. Servedio
Published in: SODA (2013)
Keyphrases
  • lower bound
  • computationally efficient
  • learning algorithm
  • upper and lower bounds
  • computational cost
  • worst case
  • theoretical analysis
  • data sets
  • neural network
  • orders of magnitude
  • running times