Hensel and Newton methods in valuation rings-Reference-Cited by-同舟云学术

Hensel and Newton methods in valuation rings

Published:1984 Issue:166 Volume:42 Page:637-661
ISSN:0025-5718
Container-title:Mathematics of Computation
language:en
Short-container-title:Math. Comp.

Author:

von zur Gathen Joachim

Abstract

We give a computational description of Hensel’s method for lifting approximate factorizations of polynomials. The general setting of valuation rings provides the framework for this and the other results of the paper. We describe a Newton method for solving algebraic and differential equations. Finally, we discuss a fast algorithm for factoring polynomials via computing short vectors in modules.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,Computational Mathematics,Algebra and Number Theory

Link

http://www.ams.org/mcom/1984-42-166/S0025-5718-1984-0736459-9/S0025-5718-1984-0736459-9.pdf

Reference30 articles.

1. Factoring polynomials over finite fields;Berlekamp, E. R.;Bell System Tech. J.,1967

2. Bourbaki, Eléments de Mathématiques, Livre II: Algèbre, Hermann, Paris, 1958.

3. On Euclid’s algorithm and the computation of polynomial greatest common divisors;Brown, W. S.;J. Assoc. Comput. Mach.,1971

4. Calculation of the Galois group over a function field of characteristic zero with an algebraically closed constant field in polynomial time;Chistov, A. L.,1990

5. Subresultants and reduced polynomial remainder sequences;Collins, George E.;J. Assoc. Comput. Mach.,1967

Cited by 29 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring;Journal of the ACM;2022-06-11

3. Factorization of Polynomials Given by Arithmetic Branching Programs;computational complexity;2021-10-15

4. Power Series Arithmetic with the BPAS Library;Computer Algebra in Scientific Computing;2020

5. Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding;Advances in Mathematics of Communications;2015