Login / Signup
Omega(log n) Lower Bounds on the Amount of Randomness in 2-Private Computation.
Anna Gál
Adi Rosén
Published in:
SIAM J. Comput. (2005)
Keyphrases
</>
lower bound
upper bound
worst case
branch and bound
branch and bound algorithm
np hard
lower and upper bounds
upper and lower bounds
quadratic assignment problem
objective function
optimal solution
set of randomly generated instances
online learning
sample complexity
randomly generated problems