Algorithm 898 : efficient multiplication of dense matrices over GF(2)
 Publisher: Association for Computing Machinery, Inc.

Related identifiers: doi: 10.1145/1644001.1644010 
Subject: QA  QA76

References
(20)
20 references, page 1 of 2
 1
 2
Aho, A., Hopcroft, J., and Ullman., J. 1974. The Design and Analysis of Computer Algorithms. AddisonWesley.
Arlazarov, V., Dinic, E., Kronrod, M., and Faradzev, I. 1970. On economical construction of the transitive closure of a directed graph. Dokl. Akad. Nauk. 194, 11. (in Russian), English Translation in Soviet Math Dokl.
Bard, G. 2008. Matrix inversion (or LUPfactorization) via the Method of Four Russians, in (n3= log n) time. In Submission.
Bard, G. V. 2006. Accelerating Cryptanalysis with the Method of Four Russians. Cryptology ePrint Archive, Report 2006/251. Available at http://eprint.iacr.org/2006/251.pdf.
Bard, G. V. 2007. Algorithms for solving linear and polynomial systems of equations over nite elds with applications to cryptanalysis. Ph.D. thesis, University of Maryland.
Bosma, W., Cannon, J., and Playoust, C. 1997. The MAGMA Algebra System I: The User Language. In Journal of Symbolic Computation 24. Academic Press, 235{265.
Brickenstein, M. and Dreyer, A. 2007. PolyBoRi: A framework for Grobner basis computations with Boolean polynomials. In Electronic Proceedings of MEGA 2007. Available at http: //www.ricam.oeaw.ac.at/mega2007/electronic/26.pdf.
Dumas, J.G. and Pernet, C. 2007. Memory e cient scheduling of StrassenWinograd's matrix multiplication algorithm. Available at http://www.citebase.org/abstract?id=oai: arXiv.org:0707.2347.
Fog, A. 2008. Optimizing software in C++. Available at http://www.agner.org/optimize.
Gray, F. 1953. Pulse code communication. US Patent No. 2,632,058.
 Similar Research Results (1)

Metrics
0views in OpenAIRE0views in local repository32downloads in local repository
The information is available from the following content providers:
From Number Of Views Number Of Downloads Warwick Research Archives Portal Repository  IRUSUK 0 32

 Download from


Cite this publication