scientific article; zbMATH DE number 1254255

MaRDI QIDQ4227301zbMATH OpenFDO

Authors Angel Díaz, Erich L. Kaltofen

Publication date 23 February 1999

zbMATH Keywords

algorithmgreatest common divisormultivariate polynomialblack box representation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in number theory (11C08) Number-theoretic algorithms; complexity (11Y16) Polynomials in real and complex fields: factorization (12D05)

Recommendations

• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
• Black-box polynomial resultants
• Greatest common divisors of polynomials given by straight-line programs
• Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
• scientific article; zbMATH DE number 799768

Cited in

(8)

• Black-box polynomial resultants
• Counting curves and their projections
• scientific article; zbMATH DE number 1775436 (Why is no real title available?)
• Sparse polynomial interpolation based on diversification
• On square-free factorization of multivariate polynomials over a finite field.
• Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
• Solving degenerate sparse polynomial systems faster
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators

Describes a project that uses

Uses Software

• Maple

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4227301)