Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
From MaRDI portal
Publication:3581452
DOI10.1145/1060590.1060678zbMath1192.94141MaRDI 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
Related Items
The Monomial Ideal Membership Problem and Polynomial Identity Testing, The ideal membership problem and polynomial identity testing, Query-efficient locally decodable codes of subexponential length, A quadratic lower bound for three-query linear locally decodable codes over any field, Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits