Beating matrix multiplication for n^1/3-directed shortcuts

DOI10.4230/LIPICS.ICALP.2022.82MaRDI QIDQ6560879zbMATH OpenFDO

Authors Shimon Kogan, M. Parter

Publication date 24 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2022.82

zbMATH Keywords

directed shortcutstransitive closurewidth

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(3)

• Co-lexicographically ordering automata and regular languages. I
• The algorithmic power of the Greene-Kleitman theorem
• Parameterized linear time transitive closure

This page was built for publication: Beating matrix multiplication for \(n^{1/3}\)-directed shortcuts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560879)