Skip Navigation

The Computer Journal 1993 36(5):485-496; doi:10.1093/comjnl/36.5.485
© 1993 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (6)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Manocha, D.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Efficient Algorithms for MultiPolynomial Resultant

D. Manocha §

Department of Computer Science, University of North Caroline, Chapel Hill, NC 27599, USA

The multipolynomial resultant of a set of equations is fundamental in quantifier elimination over the elementary theory of real and algebraically closed fields. Earlier algorithms for resultant computation and symbolic elimination are considered slow in practice. In this paper we present efficient algorithms to compute multi-polynomial resultants and demonstrates their use for polynomial manipulation and symbolic applications. The algorithms utilize the linear algebra formulation of the resultants and combine its multivariate interpolation and modular arithmetic for fast computation. It is currently being implemented as part of a package and we discuss its performance as well.

Received February 1993. revised May 1993.

* Department of Computer Science, University of North Caroline, Chapel Hill, NC 27599, USA

§ This research was supported in part by David and Lucile Packard Fellowhip, IBM Graduate Fellowship and a Junior Faculty Award.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.