Pages that link to "Item:Q3581452"
From MaRDI portal
The following pages link to Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits (Q3581452):
Displayed 6 items.
- The ideal membership problem and polynomial identity testing (Q963063) (← links)
- Query-efficient locally decodable codes of subexponential length (Q1947042) (← links)
- Operator scaling: theory and applications (Q2309517) (← links)
- A quadratic lower bound for three-query linear locally decodable codes over any field (Q2637284) (← links)
- Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits (Q2817792) (← links)
- The Monomial Ideal Membership Problem and Polynomial Identity Testing (Q5387813) (← links)