Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time (Q1078247)
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: Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time |
scientific article; zbMATH DE number 3959583
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time |
scientific article; zbMATH DE number 3959583 |
Statements
Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time (English)
0 references
1986
0 references
factorization of polynomials
0 references
polynomial complexity
0 references
homogeneous polynomials
0 references
variety
0 references
irreducible components
0 references
algorithm
0 references
