SIGN IN
SIGN UP
Efficient real root approximation
Full Text:
PDF
Buy this Article
Authors:
Michael Kerber
IST Austria, Klosterneuburg, Austria
Michael Sagraloff
Max-Planck-Institute for Informatics, Saarbruecken, Germany
Published in:
· Proceeding
ISSAC '11
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Pages 209-216
ACM
New York, NY
, USA
©2011
table of contents
ISBN: 978-1-4503-0675-1
doi>
10.1145/1993886.1993920
2011 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 21
· Downloads (cumulative): 34
· Citation Count: 4
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
ISSAC'13
Share:
|
Tags:
algorithms
computations on polynomials
polynomials, methods for
quadratic interval refinement
reliability
root approximation
root isolation
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder