Efficient techniques for multipolynomial resultant algorithms

Dinesh Manocha; John F Canny

doi:10.1145/120694.120706

Abstract

1 min read

Article Free Access Share on Efficient techniques for multipolynomial resultant algorithms Authors: Dinesh Manocha Computer Science Division, University of California, Berkeley, CA Computer Science Division, University of California, Berkeley, CAView Profile , John Canny Computer Science Division, University of California, Berkeley, CA Computer Science Division, University of California, Berkeley, CAView Profile Authors Info & Claims ISSAC '91: Proceedings of the 1991 international symposium on Symbolic and algebraic computationJune 1991 Pages 86–95https://doi.org/10.1145/120694.120706Published:01 June 1991Publication History 11citation326DownloadsMetricsTotal Citations11Total Downloads326Last 12 Months14Last 6 weeks5 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Efficient techniques for multipolynomial resultant algorithms

Abstract

Discussion(0)

Related publications

An optimal condition for determining the exact number of roots of a polynomial system

A new approach for surface intersection

Recovering high dynamic range radiance maps from photographs

PRoP

A study of priority pricing in multiple service class networks

Related publications

Article1991
An optimal condition for determining the exact number of roots of a polynomial system
Article1991

Article1991
A new approach for surface intersection
Article1991

Article1997
Recovering high dynamic range radiance maps from photographs
Article1997

Article1991
A study of priority pricing in multiple service class networks
Article1991