The following pages link to (Q5093396):
Displaying 7 items.
- Pseudorandom functions in \(\text{TC}^0\) and cryptographic limitations to proving lower bounds (Q1405738) (← links)
- Pseudorandomness for Linear Length Branching Programs and Stack Machines (Q3167416) (← links)
- (Q4370034) (← links)
- Pseudorandom Bits for Oblivious Branching Programs (Q5053059) (← links)
- (Q5875775) (← links)
- On pseudorandomness and resource-bounded measure (Q5941070) (← links)
- The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity (Q6083551) (← links)