Pages that link to "Item:Q1029336"
From MaRDI portal
The following pages link to Interpolation of polynomials given by straight-line programs (Q1029336):
Displaying 12 items.
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- A local decision test for sparse polynomials (Q407596) (← links)
- Detecting lacunary perfect powers and computing their roots (Q650838) (← links)
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- A fast parallel sparse polynomial GCD algorithm (Q1994882) (← links)
- Sparse polynomial interpolation based on derivatives (Q2156377) (← links)
- Learning algebraic decompositions using Prony structures (Q2182612) (← links)
- Faster interpolation algorithms for sparse multivariate polynomials given by straight-line programs (Q2188992) (← links)
- Monomials in arithmetic circuits: complete problems in the counting hierarchy (Q2353185) (← links)
- Faster sparse multivariate polynomial interpolation of straight-line programs (Q2635066) (← links)
- On the evaluation of some sparse polynomials (Q4600715) (← links)
- Sparse polynomials in FLINT (Q5270202) (← links)
