On the complexity of multivariate blockwise polynomial multiplication (Q5244537): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/2442829.2442861 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2056559482 / rank | |||
Normal rank | |||
Latest revision as of 20:41, 19 March 2024
scientific article; zbMATH DE number 6420360
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of multivariate blockwise polynomial multiplication |
scientific article; zbMATH DE number 6420360 |
Statements
On the complexity of multivariate blockwise polynomial multiplication (English)
0 references
27 March 2015
0 references
algorithm
0 references
evaluation-interpolation
0 references
multivariate power series
0 references
sparse polynomial multiplication
0 references
