The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity.
Zhiyuan FanJiatu LiTianqi YangPublished in: STOC (2022)
Keyphrases
- black box
- computational complexity
- pseudorandom
- high computational complexity
- black boxes
- decision problems
- white box
- memory requirements
- white box testing
- secret key
- test cases
- integration testing
- lower complexity
- worst case
- np hard
- random number
- np complete
- computational cost
- hybrid systems
- neural network
- databases
- uniformly distributed
- database
- low cost
- machine learning
- monitoring system