Pages that link to "Item:Q4633319"
From MaRDI portal
The following pages link to On polynomial approximations to AC (Q4633319):
Displaying 14 items.
- Approximation by polynomials and Blaschke products having all zeros on a circle (Q351828) (← links)
- Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy (Q685431) (← links)
- Interactive proofs for social graphs (Q2102081) (← links)
- Certifying polynomials for \(\mathsf{AC}^0[\oplus]\) circuits, with applications to lower bounds and circuit compression (Q4612476) (← links)
- (Q4636465) (← links)
- (Q4636610) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- (Q5077146) (← links)
- (Q5090936) (← links)
- Near-optimal pseudorandom generators for constant-depth read-once formulas (Q5091767) (← links)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- Separation of \(\mathrm{AC}^0[\oplus]\) formulas and circuits (Q5111381) (← links)
- On the probabilistic degree of OR over the reals (Q6074648) (← links)
- A robust version of Hegedűs's lemma, with applications (Q6566590) (← links)
