Pages that link to "Item:Q1878479"
From MaRDI portal
The following pages link to Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases (Q1878479):
Displaying 4 items.
- Interpolation of polynomials given by straight-line programs (Q1029336) (← links)
- Early termination in sparse interpolation algorithms (Q1878478) (← links)
- A nearly optimal algorithm to decompose binary forms (Q1994885) (← links)
- Reconstruction algorithms for sums of affine powers (Q2284961) (← links)
