Hybrid optimization technique for matrix chain multiplication using Strassen’s algorithm [version 2; peer review: 3 approved, 1 approved with reservations]

Background Matrix Chain Multiplication (MCM) is a fundamental problem in computational mathematics and computer science, often encountered in scientific computing, graphics, and machine learning. Traditional MCM optimization techniques use Dynamic Programming (DP) with Memoization to determine the o...

ver descrição completa

Detalhes bibliográficos

Principais autores:	Srinivasarao Thota, Rakshitha T, Thulasi Bikku
Formato:	Artigo
Idioma:	Inglês
Publicado em:	F1000 Research Ltd 2025-05-01
coleção:	F1000Research
Assuntos:	Matrix Chain Multiplication Strassen’s Algorithm Hybrid Optimization Dynamic Programming Computational Complexity. eng
Acesso em linha:	https://f1000research.com/articles/14-341/v2
Tags:	Adicionar Tag Sem tags, seja o primeiro a adicionar uma tag!