Efficient techniques for multipolynomial resultant algorithms

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Dinesh Manocha Computer Science Division, University of California, Berkeley, CA
John Canny Computer Science Division, University of California, Berkeley, CA
Published in:
· Proceeding
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Pages 86-95
ACM New York, NY, USA ©1991
table of contents ISBN:0-89791-437-6 doi>10.1145/120694.120706
Efficient techniques for multipolynomial resultant algorithms Published by ACM 1991 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 8
· Downloads (cumulative): 259
· Citation Count: 3


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder