A quasi-linear irreducibility test in K[[x]][y]

We provide an irreducibility test in the ring K [ [ x ] ] [ y ] whose complexity is quasi-linear with respect to the discriminant valuation, assuming the input polynomial F is square-free and K is a perfect field of characteristic not dividing deg ( F ) . The algorithm uses the theory of approximate...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computational complexity Ročník 31; číslo 1
Hlavní autori:	Poteaux, Adrien, Weimann, Martin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cham Springer International Publishing 01.06.2022 Springer Nature B.V Springer Verlag
Predmet:	Algebraic Geometry Algorithm Analysis and Problem Complexity Algorithms Computational Mathematics and Numerical Analysis Computer Science Mathematics Polynomials Symbolic Computation Newton polygon 68W30 11S05 Irreducibility test Residual polynomial Approximate roots 14H20 13P05 Algorithm Puiseux series Complexity 14B05
ISSN:	1016-3328, 1420-8954
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!