|
Mathematics
On combinatorial problem, related with fast matrix multiplication
Yu. V. Kuznetsov Scientific Research Institute for System Studies of RAS, Russia, 117218, Moscow, Nakhimovskii pr., k. 1, 36
Abstract:
The group-theoretical approach to fast matrix multiplication generates specific combinatorial objects, named Uniquely Solvable Puzzles (briefly USP). In the paper some numerical characteristic of the USP was discussed and the relation of USPs to famous combinatorial problem named “Cap set problem” was investigated.
Key words:
fast matrix multiplication, group-theoretical approach to fast matrix multiplication, USP, Cap set problem.
Citation:
Yu. V. Kuznetsov, “On combinatorial problem, related with fast matrix multiplication”, Izv. Saratov Univ. Math. Mech. Inform., 13:4(2) (2013), 63–67
Linking options:
https://www.mathnet.ru/eng/isu461 https://www.mathnet.ru/eng/isu/v13/i7/p63
|
Statistics & downloads: |
Abstract page: | 203 | Full-text PDF : | 91 | References: | 41 |
|