Pages that link to "Item:Q2516523"
From MaRDI portal
The following pages link to On the complexity of constructing pseudorandom functions (especially when they don't exist) (Q2516523):
Displaying 4 items.
- On the Complexity of Non-adaptively Increasing the Stretch of Pseudorandom Generators (Q3000561) (← links)
- (Q6054746) (← links)
- The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity (Q6083551) (← links)
- Structural lower bounds on black-box constructions of pseudorandom functions (Q6652977) (← links)