Pages that link to "Item:Q5422493"

The following pages link to Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits (Q5422493):

Displaying 22 items.

• Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
• A novel elementary construction of matching vectors (Q436582) (← links)
• Read-once polynomial identity testing (Q496300) (← links)
• Tight lower bounds for linear \(2\)-query LCCs over finite fields. With an appendix by Sergey Yekhanin. (Q519967) (← links)
• Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006) (← links)
• Towards lower bounds on locally testable codes via density arguments (Q693000) (← links)
• Building above read-once polynomials: identity testing and hardness of representation (Q727964) (← links)
• Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
• Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
• Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
• Improved hitting set for orbit of ROABPs (Q2087774) (← links)
• Lossless dimension expanders via linearized polynomials and subspace designs (Q2236661) (← links)
• IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM (Q2879417) (← links)
• Recent Results on Polynomial Identity Testing (Q3007643) (← links)
• (Q4612482) (← links)
• (Q5002633) (← links)
• A generalized sylvester-gallai type theorem for quadratic polynomials (Q5092455) (← links)
• (Q5121892) (← links)
• Sylvester-Gallai type theorems for quadratic polynomials (Q5126776) (← links)
• Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
• Depth-4 Identity Testing and Noether’s Normalization Lemma (Q5740194) (← links)
• Interactions of computational complexity theory and mathematics (Q6198725) (← links)