Pages that link to "Item:Q2472430"

The following pages link to Polynomial identity testing for depth 3 circuits (Q2472430):

Displaying 7 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)
• Building above read-once polynomials: identity testing and hardness of representation (Q727964) (← links)
• The ideal membership problem and polynomial identity testing (Q963063) (← links)
• Deterministic identity testing for sum of read-once oblivious arithmetic branching programs (Q1686835) (← links)
• Linear independence, alternants, and applications (Q6499241) (← links)