SIGN IN
SIGN UP
Computing Approximate GCDs in Ill-conditioned Cases
Full Text:
PDF
Buy this Article
Authors:
Masaru Sanuki
University of Tsukuba, Tsukuba-Shi, Ibaraki, Japan
Tateaki Sasaki
University of Tsukuba, Tsukuba-Shi, Ibaraki, Japan
Published in:
· Proceeding
SNC '07
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Pages 170-179
ACM
New York, NY
, USA
©2007
table of contents
ISBN: 978-1-59593-744-5
doi>
10.1145/1277500.1277525
2007 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 16
· Downloads (cumulative): 99
· Citation Count: 5
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
algorithms
approximate gcd
approximation
euclidean algorithm
experimentation
ill-conditioned problem
stabilization
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