Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Vestnik Moskov. Univ. Ser. 1. Mat. Mekh.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2020, Number 6, Pages 14–19 (Mi vmumm4360)  
Mathematics

A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices

S. B. Gashkov

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Full-text PDF (343 kB)
References:
PDF
HTML
Abstract: Some algorithms for transitive closure and Boolean matrix multiplication are compared. The bounds for size and depth of corresponding boolean circuits are given.
Key words: transitive closure of graph, boolean matrix multiplication, matrix multiplication over rings, bit complexity, boolean circuits, size and depth, modular addition and multiplication.
Funding agency Grant number
Russian Foundation for Basic Research 19-01-00294
18-01-00337
English version:
Moscow University Mathematics Bulletin, Moscow University Måchanics Bulletin, 2020, Volume 75, Issue 6, Pages 239–245
DOI: https://doi.org/10.3103/S0027132220060042
Bibliographic databases:
Document Type: Article
UDC: 519.95
Language: Russian
Citation: S. B. Gashkov, “A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2020, no. 6, 14–19; Moscow University Mathematics Bulletin, Moscow University Måchanics Bulletin, 75:6 (2020), 239–245
Citation in format AMSBIB
\Bibitem{Gas20}
\by S.~B.~Gashkov
\paper A note on the fast computation of transitive closure of graphs and the multiplication of integer matrices
\jour Vestnik Moskov. Univ. Ser.~1. Mat. Mekh.
\yr 2020
\issue 6
\pages 14--19
\mathnet{http://mi.mathnet.ru/vmumm4360}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=4243095}
\zmath{https://zbmath.org/?q=an:07352007}
\transl
\jour Moscow University Mathematics Bulletin, Moscow University Måchanics Bulletin
\yr 2020
\vol 75
\issue 6
\pages 239--245
\crossref{https://doi.org/10.3103/S0027132220060042}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=WOS:000632417100002}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85103346166}
Linking options:
  • https://www.mathnet.ru/eng/vmumm4360
  • https://www.mathnet.ru/eng/vmumm/y2020/i6/p14
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:104
    Full-text PDF :25
    References:23
    First page:9
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024