On the complexity of factoring bivariate supersparse (Lacunary) polynomials (Q5262765): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/1073884.1073914 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2028346139 / rank | |||
Normal rank | |||
Latest revision as of 22:59, 19 March 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
