Login / Signup

Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND.

Eyal KushilevitzRafail OstrovskyEmmanuel ProuffAdi RosénAdrian ThillardDamien Vergnaud
Published in: TCC (2) (2019)
Keyphrases
  • lower and upper bounds
  • lower bound
  • upper bound
  • worst case
  • upper and lower bounds
  • lower bounding
  • lagrangian relaxation
  • valid inequalities
  • computational complexity
  • privacy preserving
  • special case
  • np hard