Pages that link to "Item:Q2883826"
From MaRDI portal
The following pages link to Parallel sparse polynomial multiplication using heaps (Q2883826):
Displaying 8 items.
- Algorithmic Thomas decomposition of algebraic and differential systems (Q432753) (← links)
- Sparse polynomial division using a heap (Q540332) (← links)
- Polynomial modular product verification and its implications (Q2100047) (← links)
- Code Generation for Polynomial Multiplication (Q3644088) (← links)
- The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects (Q5178930) (← links)
- Basic Polynomial Algebra Subprograms (Q5178932) (← links)
- The basic polynomial algebra subprograms (Q5270199) (← 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)