Pages that link to "Item:Q5390577"
From MaRDI portal
The following pages link to On the Implementation of Huge Random Objects (Q5390577):
Displaying 11 items.
- Bounded-depth circuits cannot sample good codes (Q692999) (← links)
- Decompositions of graphs of functions and fast iterations of lookup tables (Q868394) (← links)
- Upper and lower bounds on black-box steganography (Q1027982) (← links)
- Derandomized constructions of \(k\)-wise (almost) independent permutations (Q2391191) (← links)
- Security levels in steganography -- insecurity does not imply detectability (Q2401760) (← links)
- Bi-Lipschitz bijection between the Boolean cube and the Hamming ball (Q2630133) (← links)
- Multilinear Pseudorandom Functions (Q3448796) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- (Q5875509) (← links)
- On mappings on the hypercube with small average stretch (Q5885200) (← links)
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error (Q6089979) (← links)
