Пропуск в контексте
Comparative Analysis of Computational Complexity of Fast Matrix Multiplication Algorithms

Comparative Analysis of Computational Complexity of Fast Matrix Multiplication Algorithms

Matrix multiplication is a commonly used operation in various graphics, imaging, robotics, and signal processing applications. In connection with the increase in the growth of the characteristics of digital information, it is necessary to improve the algorithms for processing information and the eff...

Fuld beskrivelse

Сохранить в:
Bibliografiske detaljer
Главные авторы: Abdulsalyamova, A. S., Абдулсалямова, А. Ш., Kalita, D. I., Калита, Д. И., Lyakhov, P. A., Ляхов, П. А., Nagornov, N. N., Нагорнов, Н. Н., Bergerman, M. V., Бергерман, М. В.
Format: Статья
Sprog:English
Udgivet: 2024
Fag:
Unit-gate model
SA
Computational complexity
Coppersmith-Winograd algorithm
Matrix multiplication
Online adgang:https://dspace.ncfu.ru/handle/20.500.12258/26635
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!

Internet

https://dspace.ncfu.ru/handle/20.500.12258/26635

Lignende værker