The Exact Complexity of Pseudorandom Functions and Tight Barriers to Lower Bound Proofs.
Zhiyuan FanJiatu LiTianqi YangPublished in: IACR Cryptol. ePrint Arch. (2021)
Keyphrases
- lower bound
- pseudorandom
- worst case
- upper bound
- branch and bound algorithm
- branch and bound
- np hard
- exact and approximate
- average case complexity
- random number
- optimal solution
- computational complexity
- lower bounding
- objective function
- upper and lower bounds
- uniformly distributed
- space complexity
- statistical queries
- random numbers
- sample complexity
- lower and upper bounds
- average case
- vc dimension
- secret key
- learning theory