Efficient algorithms for sparse cyclotomic integer zero testing (Q2268346)
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: Efficient algorithms for sparse cyclotomic integer zero testing |
scientific article; zbMATH DE number 5677852
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for sparse cyclotomic integer zero testing |
scientific article; zbMATH DE number 5677852 |
Statements
Efficient algorithms for sparse cyclotomic integer zero testing (English)
0 references
5 March 2010
0 references
algorithm
0 references
cyclotomic polynomial
0 references
root of unity
0 references
sparse representation
0 references
0.8526117205619812
0 references
0.7817846536636353
0 references
0.7606002688407898
0 references
0.7433661222457886
0 references
0.7419851422309875
0 references
