Sparsity considerations in Dixon resultants

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Deepak Kapur Institute for Programming and Logics, Department of Computer Science, SUNY Albany, NY
Tushar Saxena Institute for Programming and Logics, Department of Computer Science, SUNY Albany, NY
Published in:
Cover Image
 
· Proceeding
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Pages 184-191
ACM New York, NY, USA ©1996
table of contents ISBN:0-89791-785-5 doi>10.1145/237814.237862
Sparsity considerations in Dixon resultants Published by ACM 1996 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 6
· Downloads (cumulative): 187
· Citation Count: 17


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