Login / Signup
Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND.
Eyal Kushilevitz
Rafail Ostrovsky
Emmanuel Prouff
Adi Rosén
Adrian Thillard
Damien Vergnaud
Published in:
SIAM J. Discret. Math. (2021)
Keyphrases
</>
lower and upper bounds
lower bound
upper bound
lower bounding
worst case
upper and lower bounds
valid inequalities
lagrangian relaxation
computational cost
privacy preserving
branch and bound
exact and approximate
space complexity
branch and bound algorithm
data sets
computational complexity
optimal solution