Computing sparse multiples of polynomials
We consider the problem of finding a sparse multiple of a polynomial. Given a polynomial f ∈ F[x] of degree d over a field F, and a desired sparsity t = O(1), our goal is to determine if there exists a multiple h ∈ F[x] of f such that h has at most t non-zero terms, and if so, to find such an h. Whe...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/5455 |