Pages that link to "Item:Q3638914"

The following pages link to Improved Polynomial Identity Testing for Read-Once Formulas (Q3638914):

Displaying 12 items.

• Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
• Read-once polynomial identity testing (Q496300) (← 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)
• Blackbox identity testing for sum of special ROABPs and its border class (Q2041244) (← links)
• A note on parameterized polynomial identity testing using hitting set generators (Q2274524) (← links)
• Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
• Isomorphism testing of read-once functions and polynomials (Q2672283) (← links)
• Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits (Q2817792) (← links)
• Geometric complexity theory V: Efficient algorithms for Noether normalization (Q2826783) (← links)
• Recent Results on Polynomial Identity Testing (Q3007643) (← links)
• (Q6084351) (← links)