Pages that link to "Item:Q2957479"
From MaRDI portal
The following pages link to Certifying polynomials for AC^0(parity) circuits, with applications (Q2957479):
Displaying 12 items.
- Characterization of robust immune symmetric Boolean functions (Q892387) (← links)
- \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product (Q1671999) (← links)
- Expander-based cryptography meets natural proofs (Q2125080) (← links)
- Improved bounds for quantified derandomization of constant-depth circuits and polynomials (Q2311548) (← links)
- Characterization of circuits supporting polynomial systems with the maximal number of positive solutions (Q2408211) (← links)
- Certifying polynomials for \(\mathsf{AC}^0[\oplus]\) circuits, with applications to lower bounds and circuit compression (Q4612476) (← links)
- On polynomial approximations to AC (Q4633319) (← links)
- A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem (Q4957916) (← links)
- (Q5005182) (← links)
- Separation of \(\mathrm{AC}^0[\oplus]\) formulas and circuits (Q5111381) (← links)
- (Q5215664) (← links)
- Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
