Pages that link to "Item:Q4431434"
From MaRDI portal
The following pages link to On the distribution of the number of roots of polynomials and explicit weak designs (Q4431434):
Displaying 5 items.
- On splitting sets in block designs and finding roots of polynomials (Q915734) (← links)
- Simple extractors via constructions of cryptographic pseudo-random generators (Q2268098) (← links)
- A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem (Q4957916) (← links)
- Typically-correct derandomization for small time and space (Q5091759) (← links)
- A direct PRF construction from Kolmogorov complexity (Q6637531) (← links)
