Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Xu, Anthony Yang"'
Cohn and Umans proposed a framework for developing fast matrix multiplication algorithms based on the embedding computation in certain groups algebras. In subsequent work with Kleinberg and Szegedy, they connected this to the search for combinatorial
Externí odkaz:
http://arxiv.org/abs/2301.00074
Publikováno v:
Theory and Applications of Satisfiability Testing – SAT 2020
Cohn and Umans proposed a framework for developing fast matrix multiplication algorithms based on the embedding computation in certain groups algebras. In subsequent work with Kleinberg and Szegedy, they connected this to the search for combinatorial
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3716c49ae0e0384cb7a3a007fb83cd88