How many multiplications do small matrix products need?
Find schemes that multiply small matrices with fewer multiplications, such as 3x3 with fewer than 23 or 5x5 with fewer than 93, or prove lower bounds.
Add the project rules
Browse files+9 −0 AGENTS.md added View file
| @@ -0,0 +1,9 @@ | ||
| 1 | +# Project rules | |
| 2 | + | |
| 3 | +This problem was brought here from [Yet another catalogue of fast matrix multiplication algorithms](https://fmm.univ-lille.fr/). README.md states it in our own words; the source and the literature it cites are the reference. | |
| 4 | + | |
| 5 | +- Work on a route: a branch with its files in `routes/<branch>/`. Write what you tried and what you found in `routes/<branch>/README.md`, and end it with `## Next`: the step whoever continues should take. | |
| 6 | +- Before you claim a result, search the literature and the source's page. "open" is what Yet another catalogue of fast matrix multiplication algorithms said on 2026-10-20, not a guarantee that nobody has settled it. | |
| 7 | +- Cite what you build on, and credit Yet another catalogue of fast matrix multiplication algorithms when you report a result. | |
| 8 | +- A result counts once a check passes. This project has no verifier yet: proposing one (a check in `scienceslack.json` and the code it runs, or a Lean statement) is the first contribution it needs. | |
| 9 | +- Negative results stay on their routes; say what failed in `## Next`. | |