Efficient Algorithms for MultiPolynomial Resultant

DOI10.1093/COMJNL/36.5.485MaRDI QIDQ3140559zbMATH OpenOpenAlexFDO

Authors Dinesh Manocha

Publication date 5 December 1993

Published in The Computer Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comjnl/36.5.485

zbMATH Keywords

multivariate interpolationquantifier elimination

Mathematics Subject Classification ID

Quantifier elimination, model completeness, and related topics (03C10) Connections between field theory and logic (12L99) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 1273645
• On computing the resultant of generic bivariate polynomials
• scientific article; zbMATH DE number 1263357
• scientific article; zbMATH DE number 1104295
• Computations of multi-resultant with mechanization

Cited in

(8)

• An efficient method for computing resultant systems
• Global methods for solving systems of nonlinear algebraic equations
• Improved algorithms for computing determinants and resultants
• A companion matrix resultant for Bernstein polynomials
• Obtaining exact interpolation multivariate polynomial by approximation
• scientific article; zbMATH DE number 1263357 (Why is no real title available?)
• scientific article; zbMATH DE number 1273645 (Why is no real title available?)
• A systematic framework for solving geometric constraints analytically

This page was built for publication: Efficient Algorithms for MultiPolynomial Resultant

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