Login / Signup

A Lower Bound for Proving Hardness of Learning with Rounding with Polynomial Modulus.

Parker NewtonSilas Richelson
Published in: CRYPTO (5) (2022)
Keyphrases
  • lower bound
  • learning process
  • learning systems
  • machine learning
  • learning algorithm
  • branch and bound algorithm
  • prior knowledge
  • online learning
  • learning tasks
  • neural network
  • e learning
  • np complete