Algorithm 898: Efficient multiplication of dense matrices over GF(2)

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Martin Albrecht Royal Holloway, University of London, United Kingdom
Gregory Bard Fordham University, Bronx, NY
William Hart University of Warwick, United Kingdom
Published in:
Cover Image
 
· Journal
ACM Transactions on Mathematical Software (TOMS) TOMS Homepage archive
Volume 37 Issue 1, January 2010
Article No. 9
ACM New York, NY, USA
table of contents doi>10.1145/1644001.1644010
Algorithm 898: Efficient multiplication of dense matrices over GF(2) Published by ACM 2010 Article
  • Research
  • Refereed
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 37
· Downloads (cumulative): 267
· Citation Count: 1


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