scientific article; zbMATH DE number 1254255
From MaRDI portal
Publication:4227301
zbMATH Open0919.12007MaRDI QIDQ4227301FDOQ4227301
Authors: Angel Díaz, Erich L. Kaltofen
Publication date: 23 February 1999
Title of this publication is not available (Why is that?)
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
Symbolic computation and algebraic computation (68W30) Polynomials in number theory (11C08) Number-theoretic algorithms; complexity (11Y16) Polynomials in real and complex fields: factorization (12D05)
Cited In (8)
- Counting curves and their projections
- Black-box polynomial resultants
- Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
- Solving degenerate sparse polynomial systems faster
- On square-free factorization of multivariate polynomials over a finite field.
- Factoring multivariate polynomials represented by black boxes: a Maple + C implementation
- Title not available (Why is that?)
- Sparse polynomial interpolation based on diversification
Uses Software
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)