Pages that link to "Item:Q483707"

The following pages link to Randomness buys depth for approximate counting (Q483707):

Displaying 7 items.

• Randomness-efficient sampling within NC\(^{1}\) (Q937194) (← links)
• The complexity of distributions (Q2884580) (← links)
• Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
• A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem (Q4957916) (← links)
• Pseudo-Derandomizing Learning and Approximation (Q5009554) (← links)
• Fourier bounds and pseudorandom generators for product tests (Q5091757) (← links)
• More on bounded independence plus noise: pseudorandom generators for read-once polynomials (Q5140841) (← links)