The Exact Complexity of Pseudorandom Functions and Tight Barriers to Lower Bound Proofs.
Zhiyuan FanJiatu LiTianqi YangPublished in: Electron. Colloquium Comput. Complex. (2021)
Keyphrases
- lower bound
- worst case
- pseudorandom
- upper bound
- branch and bound
- branch and bound algorithm
- uniformly distributed
- objective function
- optimal solution
- computational complexity
- average case complexity
- exact and approximate
- lower and upper bounds
- np hard
- random number
- sample complexity
- real time
- low cost
- space complexity
- decision problems
- scheduling problem
- theorem proving
- upper and lower bounds
- linear programming relaxation
- feature selection
- learning algorithm
- lower bounding