Skip to main content
Log in

An Efficient Method for Computing Resultant Systems

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

A resultant system of a finite set of polynomials in two homogeneous variables is a finite set of polynomials in the coefficients of the original polynomials whose vanishing is a necessary and sufficient condition for the original polynomials to have a common non-trivial zero. We present an efficient general method for computing resultant systems. If there are s polynomials and each has degree at most d, the resultant system will have O(s 2 d) polynomials, each of which will have degree at most d 2.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: February 4, 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Encarnación, M. An Efficient Method for Computing Resultant Systems. AAECC 9, 243–245 (1998). https://doi.org/10.1007/s002000050105

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002000050105

Navigation