On the complexity of factoring bivariate supersparse (Lacunary) polynomials (Q5262765): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:08, 8 February 2024
scientific article; zbMATH DE number 6459450
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of factoring bivariate supersparse (Lacunary) polynomials |
scientific article; zbMATH DE number 6459450 |
Statements
On the complexity of factoring bivariate supersparse (Lacunary) polynomials (English)
0 references
16 July 2015
0 references
NP-hardness
0 references
lacunary polynomials
0 references
multivariate polynomials
0 references
polynomial factorizations
0 references
polynomial-time complexity
0 references
sparse polynomials
0 references
