scientific article; zbMATH DE number 2145003

zbMATH Open1134.13310MaRDI QIDQ4657307FDOQ4657307

Authors Arthur Chtcherba, Deepak Kapur

Publication date 14 March 2005

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computational aspects and applications of commutative rings (13P99) Nonlinear algebraic or transcendental equations (65H99)

Recommendations

• Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation
• Constructing Sylvester-type resultant matrices using the Dixon formulation
• Conditions for exact resultants using the Dixon formulation
• On the Mixed Cayley-Sylvester Resultant Matrix
• Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation

Cited in

(1)

• Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation

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 Q4657307)