Pages that link to "Item:Q4810194"

The following pages link to Comparing the speed of programs for sparse polynomial multiplication (Q4810194):

Displaying 7 items.

• Chunky and equal-spaced polynomial multiplication (Q540329) (← links)
• Sparse polynomial division using a heap (Q540332) (← links)
• Good coupling for the multiscale patch scheme on systems with microscale heterogeneity (Q2424438) (← links)
• Compact representation of polynomials for algorithms for computing Gröbner and involutive bases (Q2629402) (← links)
• INTEGRATION BY PARTS: AN INTRODUCTION (Q2919047) (← links)
• Evaluation of a Java Computer Algebra System (Q3597987) (← links)
• The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects (Q5178930) (← links)