Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles

ABSTRACT: Cohn and Umans proposed a framework for developing fast matrix multiplication algorithms based on the embedding computation in certain groups algebras [9]. In subsequent work with Kleinberg and Szegedy, they connected this to the search for combinatorial objects called strong uniquely solvable puzzles (strong USPs) [8]. We begin a systematic computer-aided search for these objects. We develop and implement algorithms based on reductions to

SUBMITTER: Pulina L 

PROVIDER: S-EPMC7326541 | biostudies-literature | 2020 Jun

REPOSITORIES: biostudies-literature