Complexity and performance results for non FFT-based univariate polynomial multiplication (Q5175243)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Complexity and performance results for non FFT-based univariate polynomial multiplication |
scientific article; zbMATH DE number 6406641
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity and performance results for non FFT-based univariate polynomial multiplication |
scientific article; zbMATH DE number 6406641 |
Statements
Complexity and performance results for non FFT-based univariate polynomial multiplication (English)
0 references
20 February 2015
0 references
