Computing the irreducible real factors and components of an algebraic curve

DOI10.1007/BF01810297zbMath0737.14018MaRDI QIDQ1814128

Erich L. Kaltofen

Publication date: 25 June 1992

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

polynomial time algorithmdecomposition of an algebraic curve

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational aspects of algebraic curves (14Q05)

Related Items (3)

Finding irreducible components of some real transcendental varieties ⋮ Factoring multivariate polynomials via partial differential equations ⋮ Lifting and recombination techniques for absolute factorization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast parallel absolute irreducibility testing
• Deterministic irreducibility testing of polynomials over large finite fields
• An inequality for the discriminant of a polynomial
• A new decision method for elementary algebra
• Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization
• An Exact Method for Finding the Roots of a Complex Polynomial
• A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
• The Minimum Root Separation of a Polynomial
• Cylindrical Algebraic Decomposition I: The Basic Algorithm

This page was built for publication: Computing the irreducible real factors and components of an algebraic curve