Pages that link to "Item:Q1351508"

The following pages link to On some approximation problems concerning sparse polynomials over finite fields (Q1351508):

Displaying 7 items.

• Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in (Q654006) (← links)
• Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
• Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines. (Q1390870) (← links)
• Zero testing of \(p\)-adic and modular polynomials (Q1575936) (← links)
• Sparse univariate polynomials with many roots over finite fields (Q2363328) (← links)
• Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
• On the number of distinct roots of a lacunary polynomial over finite fields (Q2662052) (← links)