Pages that link to "Item:Q540332"
From MaRDI portal
The following pages link to Sparse polynomial division using a heap (Q540332):
Displaying 10 items.
- Polynomial modular product verification and its implications (Q2100047) (← links)
- Computation of involutive and Gröbner bases using the tableau representation of polynomials (Q2217202) (← links)
- POLY: A New Polynomial Data Structure for Maple 17 (Q2799569) (← links)
- Giac and GeoGebra – Improved Gröbner Basis Computations (Q2808009) (← links)
- Lazy and Forgetful Polynomial Arithmetic and Applications (Q3644102) (← links)
- Fermat benchmarks for rational expressionals in maple (Q5268831) (← links)
- Fundamental invariants for the action of $SL_3(\mathbb {C}) \times SL_3(\mathbb {C}) \times SL_3(\mathbb {C})$ on $3 \times 3 \times 3$ arrays (Q5326518) (← links)
- Chordal Networks of Polynomial Ideals (Q5347294) (← links)
- Design and implementation of multi-threaded algorithms in polynomial algebra (Q6666514) (← links)
- On exact division and divisibility testing for sparse polynomials (Q6666532) (← links)
