Space Pseudorandom Generators by Communication Complexity Lower Bounds.
Anat GanorRan RazPublished in: Electron. Colloquium Comput. Complex. (2013)
Keyphrases
- lower bound
- pseudorandom
- random numbers
- worst case
- upper bound
- search space
- uniformly distributed
- objective function
- space requirements
- average case complexity
- upper and lower bounds
- branch and bound
- space complexity
- vc dimension
- communication networks
- communication cost
- lower and upper bounds
- low cost
- information sharing
- space time
- average case
- computational complexity
- encryption algorithm
- random number
- optimal solution
- real time