Output-sensitive algorithms for sumset and sparse polynomial multiplication (Q2819733)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6631242
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Output-sensitive algorithms for sumset and sparse polynomial multiplication |
scientific article; zbMATH DE number 6631242 |
Statements
29 September 2016
0 references
computational complexity
0 references
Minkowski sum
0 references
polynomial multiplication
0 references
sparse interpolation
0 references
sumset
0 references
Output-sensitive algorithms for sumset and sparse polynomial multiplication (English)
0 references
0.7659765481948853
0 references
0.7642619013786316
0 references
0.7494489550590515
0 references
0.7492824196815491
0 references
0.7464533448219299
0 references
