A fast recursive algorithm for multiplying matrices of order n=3q (q>1)

Збережено в:
Бібліографічні деталі
Дата:2021
Автор: L. D. Elfimova
Формат: Стаття
Мова:English
Опубліковано: 2021
Назва видання:Cybernetics and Systems Analysis
Онлайн доступ:http://jnas.nbuv.gov.ua/article/UJRN-0001221020
Теги: Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!

Репозиторії

Library portal of National Academy of Sciences of Ukraine | LibNAS
id open-sciencenbuvgovua-4384
record_format dspace
spelling open-sciencenbuvgovua-43842024-02-25T15:46:26Z A fast recursive algorithm for multiplying matrices of order n=3q (q>1) L. D. Elfimova 1019-5262 2021 en Cybernetics and Systems Analysis http://jnas.nbuv.gov.ua/article/UJRN-0001221020 Article
institution Library portal of National Academy of Sciences of Ukraine | LibNAS
collection Open-Science
language English
series Cybernetics and Systems Analysis
spellingShingle Cybernetics and Systems Analysis
L. D. Elfimova
A fast recursive algorithm for multiplying matrices of order n=3q (q>1)
format Article
author L. D. Elfimova
author_facet L. D. Elfimova
author_sort L. D. Elfimova
title A fast recursive algorithm for multiplying matrices of order n=3q (q>1)
title_short A fast recursive algorithm for multiplying matrices of order n=3q (q>1)
title_full A fast recursive algorithm for multiplying matrices of order n=3q (q>1)
title_fullStr A fast recursive algorithm for multiplying matrices of order n=3q (q>1)
title_full_unstemmed A fast recursive algorithm for multiplying matrices of order n=3q (q>1)
title_sort fast recursive algorithm for multiplying matrices of order n=3q (q>1)
publishDate 2021
url http://jnas.nbuv.gov.ua/article/UJRN-0001221020
work_keys_str_mv AT ldelfimova afastrecursivealgorithmformultiplyingmatricesofordern3qqgt1
AT ldelfimova fastrecursivealgorithmformultiplyingmatricesofordern3qqgt1
first_indexed 2024-03-30T06:30:48Z
last_indexed 2024-03-30T06:30:48Z
_version_ 1796877724290121728