Pages that link to "Item:Q5120174"
From MaRDI portal
The following pages link to What Can (and Can't) we Do with Sparse Polynomials? (Q5120174):
Displaying 13 items.
- Amortized multi-point evaluation of multivariate polynomials (Q2099269) (← links)
- Polynomial modular product verification and its implications (Q2100047) (← links)
- Termination of polynomial loops (Q2233526) (← links)
- Fast amortized multi-point evaluation (Q2238846) (← links)
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation (Q2680117) (← links)
- Output-sensitive algorithms for sumset and sparse polynomial multiplication (Q2819733) (← links)
- Implementing the Tangent Graeffe Root Finding Method (Q5041082) (← links)
- A New Black Box Factorization Algorithm - the Non-monic Case (Q6060365) (← links)
- Methodologies of Symbolic Computation (Q6163846) (← links)
- Interpolation by decomposable univariate polynomials (Q6614422) (← links)
- Practical algebraic calculus and Nullstellensatz with the checkers Pacheck and Pastèque and Nuss-Checker (Q6661748) (← links)
- Fast interpolation of multivariate polynomials with sparse exponents (Q6665433) (← links)
- Sparse multiplication of multivariate linear differential operators (Q6666531) (← links)