Pages that link to "Item:Q5171176"

The following pages link to Blackbox Polynomial Identity Testing for Depth 3 Circuits (Q5171176):

Displaying 18 items.

• Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← 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)
• Deterministic polynomial identity tests for multilinear bounded-read formulae (Q901932) (← links)
• Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
• Improved hitting set for orbit of ROABPs (Q2087774) (← links)
• Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
• Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits (Q2817792) (← 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)
• 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)