The complexity of sparse Hensel lifting and sparse polynomial factorization (Q2284969)
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 7151948
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of sparse Hensel lifting and sparse polynomial factorization |
scientific article; zbMATH DE number 7151948 |
Statements
The complexity of sparse Hensel lifting and sparse polynomial factorization (English)
0 references
15 January 2020
0 references
polynomial factorization
0 references
sparse polynomial interpolation
0 references
multivariate Hensel lifting
0 references
polynomial Diophantine equations
0 references
0.944277286529541
0 references
0.8739039301872253
0 references
0.8624884486198425
0 references
0.857503354549408
0 references
