Certifying polynomials for AC^0(parity) circuits, with applications
From MaRDI portal
Publication:2957479
DOI10.4230/LIPIcs.FSTTCS.2012.36zbMath1354.68094OpenAlexW2281885423MaRDI QIDQ2957479
Swastik Kopparty, Srikanth Srinivasan
Publication date: 26 January 2017
Full work available at URL: https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2012.html#KoppartyS12
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Expander-based cryptography meets natural proofs ⋮ \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product ⋮ Characterization of robust immune symmetric Boolean functions ⋮ Unnamed Item ⋮ On polynomial approximations to AC ⋮ A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus$ via the Coin Problem] ⋮ Improved bounds for quantified derandomization of constant-depth circuits and polynomials ⋮ Unnamed Item ⋮ Efficient Construction of Rigid Matrices Using an NP Oracle
This page was built for publication: Certifying polynomials for AC^0(parity) circuits, with applications
