From an approximate to an exact absolute polynomial factorization-Reference-Cited by-同舟云学术

From an approximate to an exact absolute polynomial factorization

Published:2006-06 Issue:6 Volume:41 Page:682-696
ISSN:0747-7171
Container-title:Journal of Symbolic Computation
language:en
Short-container-title:Journal of Symbolic Computation

Author:

Chèze Guillaume,Galligo André

Publisher

Elsevier BV

Subject

Computational Mathematics,Algebra and Number Theory

Reference22 articles.

1. Chèze, G., 2004a. Des méthodes symboliques–numériques et exactes pour la factorisation absolue des polynômes en deux variables. Ph.D. Thesis. Université de Nice-Sophia Antipolis

2. Chèze, G., 2004b. Absolute polynomial factorization in several variables and the knapsack problem. In: Proceedings of ISSAC 2004. pp. 87–94

3. Four lessons on absolute polynomial factorization;Chèze,2005

4. A Course in Computational Algebraic Number Theory;Cohen,1993

5. A geometric–numeric algorithm for factoring multivariate polynomials;Corless,2002

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

1. Some Control Observation Problems and Their Differential Algebraic Partial Solutions;Algebraic and Symbolic Computation Methods in Dynamical Systems;2020

2. Computing the Determinant of a Matrix with Polynomial Entries by Approximation;Journal of Systems Science and Complexity;2017-05-02

3. Symmetry detection of rational space curves from their curvature and torsion;Computer Aided Geometric Design;2015-02

4. Exact bivariate polynomial factorization over ℚ by approximation of roots;Journal of Systems Science and Complexity;2014-08-28

5. Rational Hausdorff divisors: A new approach to the approximate parametrization of curves;Journal of Computational and Applied Mathematics;2014-06