A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication

ISSN： 0178-4617

Source： Algorithmica, Vol.61, Iss.1, 2011-09, pp. : 36-50

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

On Minimum Witnesses for Boolean Matrix Multiplication

By Cohen Keren Yuster Raphael

Algorithmica, Vol. 69, Iss. 2, 2014-06 ,pp. : 431-442

Springer Publishing Company

Access to resources Recommend Favorite

Fast Inclusion of Interval Matrix Multiplication

By Ogita Takeshi Oishi Shin’ichi

Reliable Computing, Vol. 11, Iss. 3, 2005-06 ,pp. : 191-205

Springer Publishing Company

Access to resources Recommend Favorite

Using fast matrix multiplication to find basic solutions

By Beling P.A. Megiddo N.

Theoretical Computer Science, Vol. 205, Iss. 1, 1998-08 ,pp. : 307-316

Elsevier

Access to resources Recommend Favorite

Parallel Output-Sensitive Algorithms for Combinatorial and Linear Algebra Problems

By Reif J.H.

Journal of Computer and System Sciences, Vol. 62, Iss. 3, 2001-05 ,pp. : 398-412

Academic Press

Access to resources Recommend Favorite

Fast Matrix-Vector Multiplication in the Sparse-Grid Galerkin Method

By Zeiser Andreas

Journal of Scientific Computing, Vol. 47, Iss. 3, 2011-06 ,pp. : 328-346

Springer Publishing Company

Access to resources Recommend Favorite