English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In 1969, V. Strassen improves the classical~2x2 matrix multiplicationalgorithm. The current upper bound for 3x3 matrix multiplication was reached byJ.B. Laderman in 1976. This note presents a geometric relationship betweenStrassen and Laderman algorithms. By doing so, we retrieve a geometricformulation of results very similar to those presented by O. Sykora in 1977.

Laderman matrix multiplication algorithm can be constructed using Strassen algorithm and related tensor's isotropies