Fast exact algorithms using Hadamard product of polynomials (Q832524)
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 7498366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast exact algorithms using Hadamard product of polynomials |
scientific article; zbMATH DE number 7498366 |
Statements
Fast exact algorithms using Hadamard product of polynomials (English)
0 references
25 March 2022
0 references
parameterized complexity
0 references
multilinear monomial detection
0 references
multilinear monomial counting
0 references
arithmetic circuits
0 references
0 references
0.9822481274604796
0 references
0.8102038502693176
0 references
0.7875831127166748
0 references
0.7738858461380005
0 references
0.7501832842826843
0 references
