SIGN IN
SIGN UP
On computational properties of chains of recurrences
Full Text:
Pdf
Buy this Article
Author:
Eugene V. Zima
Univ. of Waterloo, Waterloo, Canada
Published in:
· Proceeding
ISSAC '01
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
ACM
New York, NY
, USA
©2001
table of contents
ISBN:1-58113-417-7
doi>
10.1145/384101.384148
2001 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 13
· Citation Count: 1
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
general
languages
measurement
performance
reliability
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