Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
From MaRDI portal
Publication:3581452
DOI10.1145/1060590.1060678zbMath1192.94141OpenAlexW2073240615MaRDI QIDQ3581452
Publication date: 16 August 2010
Published in: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1060590.1060678
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
A quadratic lower bound for three-query linear locally decodable codes over any field ⋮ Query-efficient locally decodable codes of subexponential length ⋮ The Monomial Ideal Membership Problem and Polynomial Identity Testing ⋮ The ideal membership problem and polynomial identity testing ⋮ Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits ⋮ Operator scaling: theory and applications
This page was built for publication: Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
