Computing machine-efficient polynomial approximations

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Nicolas Brisebarre Université J. Monnet, St-Étienne and LIP-E.N.S. Lyon, Lyon Cedex, France
Jean-Michel Muller CNRS, LIP-ENS Lyon, Lyon Cedex, France
Arnaud Tisserand INRIA, LIP-ENS Lyon, Lyon Cedex, France
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 32 Issue 2, June 2006
Pages 236-256
ACM New York, NY, USA
table of contents doi>10.1145/1141885.1141890
Computing machine-efficient polynomial approximations Published by ACM 2006 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 32
· Downloads (cumulative): 476
· Citation Count: 6


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