Pages that link to "Item:Q1934308"

The following pages link to Computing sparse multiples of polynomials (Q1934308):

Displaying 14 items.

• Computing values of a polynomial with only few multiplications (Q1313709) (← links)
• On some approximation problems concerning sparse polynomials over finite fields (Q1351508) (← links)
• Algorithms for computing sparse shifts for multivariate polynomials (Q1583886) (← links)
• Computing sparse GCD of multivariate polynomials via polynomial interpolation (Q1621170) (← links)
• Unlikely intersections and multiple roots of sparse polynomials (Q1686795) (← links)
• A theory and an algorithm for computing sparse multivariate polynomial remainder sequence (Q1798335) (← links)
• Output-sensitive algorithms for sumset and sparse polynomial multiplication (Q2819733) (← links)
• (Q4227280) (← links)
• On some computations on sparse polynomials (Q5002654) (← links)
• Efficiently Computing Real Roots of Sparse Polynomials (Q5119944) (← links)
• What Can (and Can't) we Do with Sparse Polynomials? (Q5120174) (← links)
• Nearly Optimal Sparse Polynomial Multiplication (Q5138887) (← links)
• Sparse multiplication for skew polynomials (Q5145973) (← links)
• Computing the binomial part of a polynomial ideal (Q6192534) (← links)