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...

Descripción completa

Detalles Bibliográficos

Autores principales:	Srinivasarao Thota, Rakshitha T, Thulasi Bikku
Formato:	Artigo
Lenguaje:	Inglês
Publicado:	F1000 Research Ltd 2025-05-01
Colección:	F1000Research
Materias:	Matrix Chain Multiplication Strassen’s Algorithm Hybrid Optimization Dynamic Programming Computational Complexity. eng
Acceso en línea:	https://f1000research.com/articles/14-341/v2
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!