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

For something Strassen-ish you could look at https://jianyuhuang.com/papers/sc16.pdf and the GPU implementation https://apps.cs.utexas.edu/apps/sites/default/files/tech_rep...


That's matrix-matrix multiplication. Nobody disputes that Strassen etc. have sub-cubic complexity. What about one of the six decompositions mentioned, as GP claimed?


I responded to a post about the practicality of MM multiplication methods, though GEMM is quite fundamental.




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

Search: