Algorithm of polynomial complexity for factoring polynomials over local fields (Q1190956): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02112431 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2077346602 / rank | |||
Normal rank | |||
Latest revision as of 11:10, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithm of polynomial complexity for factoring polynomials over local fields |
scientific article |
Statements
Algorithm of polynomial complexity for factoring polynomials over local fields (English)
0 references
27 September 1992
0 references
See the review in Zbl 0761.11046.
0 references
Newton polygons
0 references
algorithm
0 references
factoring multivariable polynomials over local fields
0 references
polynomial time
0 references
integral basis
0 references
