Factoring bivariate polynomials using adjoints
From MaRDI portal
Publication:2437285
DOI10.1016/j.jsc.2013.05.011zbMath1287.13016arXiv1201.5787OpenAlexW2110012484MaRDI QIDQ2437285
Publication date: 3 March 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.5787
Symbolic computation and algebraic computation (68W30) Plane and space curves (14H50) Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials, factorization in commutative rings (13P05) Singularities of curves, local rings (14H20)
Related Items (4)
Bivariate factorization using a critical fiber ⋮ An algorithm to compute the adjoint ideal of an affine plane algebraic curve ⋮ Sparse bivariate polynomial factorization ⋮ Exact bivariate polynomial factorization over \(\mathbb Q\) by approximation of roots
Cites Work
- Complexity bounds for the rational Newton-Puiseux algorithm over finite fields
- A lifting and recombination algorithm for rational factorization of sparse polynomials
- Sums of residues on algebraic surfaces and application to coding theory
- Integration of rational functions: Rational computation of the logarithmic part
- New recombination algorithms for bivariate polynomial factorization based on Hensel lifting
- Lectures on equations defining space curves. Notes by N. Mohan Kumar
- An algebraic approach to computing adjoint curves
- Lifting and recombination techniques for absolute factorization
- Fast separable factorization and applications
- Reduction of bivariate polynomials from convex-dense to dense, with application to factorizations
- Absolute Factorization of Polynomials: A Geometric Approach
- Lectures on Resolution of Singularities (AM-166)
- Residues of differentials on curves
- An Arithmetic Theory of Adjoint Plane Curves
- Computing Riemann matrices of algebraic curves
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Factoring bivariate polynomials using adjoints
