author-photo

Alexandre Sedoglavic

university of lille

35

Papers

295

Citations

Citation Trend

Filter By

Papers (35) Sort By

Journal Conference Others

Some fast algorithms multiplying a matrix by its adjoint

2023 Journal of Symbolic Computation
Show All
- Source
- Cite
- Save
Citations (0)
The tensor rank of 5x5 matrices multiplication is bounded by 98 and its border rank by 89.

2021 arXiv: Computational Complexity
- Alexandre Sedoglavic
- Alexey V. Smirnov
Show All
- Source
- Cite
- Save
Citations (0)
The Tensor Rank of 5x5 Matrices Multiplication is Bounded by 98 andIts Border Rank by 89

2021 ISSAC | International Symposium on Symbolic and Algebraic Computation
- Alexandre Sedoglavic
- Alexey V. Smirnov
Show All
- Source
- Cite
- Save
Citations (0)
Some fast algorithms multiplying a matrix by its adjoint.

2021 Journal of Symbolic Computation
Show All
- Source
- Cite
- Save
Citations (0)
Some fast algorithms multiplying a matrix by its adjoint

2021
Show All
- Source
- Cite
- Save
Citations (0)
On fast multiplication of a matrix by its transpose

2020 arXiv: Symbolic Computation
Show All
- Source
- Cite
- Save
Citations (2)
On fast multiplication of a matrix by its transpose.

2020 arXiv: Symbolic Computation
Show All
- Source
- Cite
- Save
Citations (0)
On fast multiplication of a matrix by its transpose.

2020 arXiv: Symbolic Computation
Show All
- Source
- Cite
- Save
Citations (1)
Laderman matrix multiplication algorithm can be constructed using Strassen algorithm and related tensor's isotropies

2017 arXiv: Symbolic Computation
- Alexandre Sedoglavic
Show All
- Source
- Cite
- Save
Citations (4)
Brute force meets Bruno force in parameter optimisation: introduction of novel constraints for parameter accuracy improvement by symbolic computation

2011 Iet Systems Biology
Show All
- Source
- Cite
- Save
Citations (2)