Almost tight recursion tree bounds for the Descartes method

Full Text: PdfPdf Buy this ArticleBuy this Article
Authors: Arno Eigenwillig Max-Planck-Institut für Informatik, Saarbrücken, Germany
Vikram Sharma NYU, New York
Chee K. Yap NYU, New York
Published in:
· Proceeding
ISSAC '06 Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Pages 71 - 78
ACM New York, NY, USA ©2006
table of contents ISBN:1-59593-276-3 doi>10.1145/1145768.1145786
Almost tight recursion tree bounds for the Descartes method Published by ACM 2006 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 13
· Downloads (cumulative): 163
· Citation Count: 30


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