Algorithm 575: Permutations for a Zero-Free Diagonal [F1]

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: I. S. Duff Computer Science and Systems Division, Building 8.9, AERE Harewell, Oxon, England
Published in:
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 7 Issue 3, Sept. 1981
Pages 387-390
ACM New York, NY, USA
table of contents doi>10.1145/355958.355968
Algorithm 575: Permutations for a Zero-Free Diagonal [F1] Published by ACM 1981 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 12
· Downloads (12 Months): 44
· Downloads (cumulative): 551
· Citation Count: 14


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