Space Pseudorandom Generators by Communication Complexity Lower Bounds.
Anat GanorRan RazPublished in: APPROX-RANDOM (2014)
Keyphrases
- lower bound
- pseudorandom
- random numbers
- worst case
- upper bound
- objective function
- average case complexity
- random number
- average case
- branch and bound algorithm
- space complexity
- low dimensional
- space time
- communication systems
- lower and upper bounds
- np hard
- secret key
- space requirements
- optimal solution
- branch and bound
- search space
- computational complexity
- real time