Pages that link to "Item:Q5090395"
From MaRDI portal
The following pages link to Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gates (Q5090395):
Displaying 9 items.
- Quantum versus randomized communication complexity, with efficient players (Q2099674) (← links)
- Paraunitary-Based Boolean Generator for QAM Complementary Sequences of Length <inline-formula> <tex-math notation="LaTeX">$2^{K}$ </tex-math> </inline-formula> (Q4682886) (← links)
- A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem (Q4957916) (← links)
- (Q5077146) (← links)
- Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization (Q5080481) (← links)
- Fourier bounds and pseudorandom generators for product tests (Q5091757) (← links)
- Parity helps to compute majority (Q5091774) (← links)
- (Q5875501) (← links)
- A robust version of Hegedűs's lemma, with applications (Q6566590) (← links)
