If you look at it that way then any algorithm is just o(n) where n is the number... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		cochne on Oct 5, 2022 \| parent \| context \| favorite \| on: Discovering faster matrix multiplication algorithm... If you look at it that way then any algorithm is just o(n) where n is the number of matrices. O does not care about constant factors

vlovich123 on Oct 7, 2022 [–]

There's a better explanation here: https://fgiesen.wordpress.com/2022/10/06/on-alphatensors-new...

This is for matrix multiplication where elements are themselves 4x4 matrices. So yes, indeed this is about multiplying many many 4x4 matrices where N is the size of the outer matrix.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact