scientific article
From MaRDI portal
Publication:3304119
DOI10.4230/LIPIcs.STACS.2018.23zbMath1487.68120arXiv1801.05202MaRDI QIDQ3304119
Michal Koucký, Debarati Das, Michael E. Saks
Publication date: 5 August 2020
Full work available at URL: https://arxiv.org/abs/1801.05202
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Basic linear algebra (15A99) Randomized algorithms (68W20) Boolean and Hadamard matrices (15B34)
Cites Work
- Matrix multiplication via arithmetic progressions
- General context-free recognition in less than cubic time
- An improved combinatorial algorithm for Boolean matrix multiplication
- Gaussian elimination is not optimal
- Efficient determination of the transitive closure of a directed graph
- Powers of tensors and fast matrix multiplication
- Speeding up the Four Russians Algorithm by About One More Logarithmic Factor
- Multiplying matrices faster than coppersmith-winograd
- Nearly complete graphs decomposable into large induced matchings and their applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
