Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs.
Alexander E. AndreevJuri L. BaskakovAndrea E. F. ClementiJosé D. P. RolimPublished in: ICALP (1999)
Keyphrases
- lower bound
- pseudorandom
- upper bound
- uniformly distributed
- branch and bound algorithm
- branch and bound
- lower and upper bounds
- np hard
- random number
- worst case
- objective function
- sample complexity
- secret key
- optimal solution
- random numbers
- vc dimension
- multi dimensional
- small number
- max sat
- online algorithms
- machine learning