当前位置: X-MOL 学术Moscow Univ. Math. Bull. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A Note on the Fast Computation of Transitive Closure of Graphs and the Multiplication of Integer Matrices
Moscow University Mathematics Bulletin ( IF 0.2 ) Pub Date : 2021-03-24 , DOI: 10.3103/s0027132220060042
S. B. Gashkov

Abstract

Some algorithms for computing transitive closure of a graph and matrix multiplication in the Boolean semiring and in the rings of residues are compared. The bounds for the size and depth of the corresponding Boolean circuits are given.



中文翻译:

关于图的传递闭合快速计算和整数矩阵相乘的一个注记

摘要

比较了用于计算图形的传递闭合和布尔半环和残基环中的矩阵乘法的一些算法。给出了相应布尔电路的大小和深度的界限。

更新日期:2021-03-25
down
wechat
bug