Login / Signup
Explicit lower bound for fooling polynomials by the sum of small-bias generators.
Shachar Lovett
Yoav Tzur
Published in:
Electron. Colloquium Comput. Complex. (2009)
Keyphrases
</>
lower bound
upper bound
objective function
optimal solution
small number
trade off
np hard
branch and bound
lower and upper bounds
database
decision trees
branch and bound algorithm
weighted sum
linear programming relaxation