Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) [See also 68Q15]
3 mapped entries · Browse and filter all →
Counts include all statuses and descendants. Classifications are editorial or inferred from community fields, not an AMS assessment of the problem.
Dual matrix multiplication exponent: determine C 15b or improve its bounds; the repository records 0.321334 (lower) and 1 (upper).
Matrix multiplication exponent: determine C 15a or improve its bounds; the repository records 2 (lower) and 2.371177 (upper).
The Rank of the 4 times4 Matrix-Multiplication Tensor. Moderately interesting problem from Epoch AI’s FrontierMath: Open Problems; answers are checked by a verifier program.
These are selected sources for the parent class. Article coverage is a first reviewed selection, and may not cover this exact subcategory.
Springer Nature
Discrete geometry and geometric computation
SIAM
Theory of computation
SIAM
Applied and computational mathematics reviews
2007 · 2 questions extracted
2020 · 0 questions extracted
MSC2020 © Mathematical Reviews (AMS) and zbMATH · CC BY-NC-SA 4.0 · Official PDF, page 176