On the Computational Complexity of Bongartz's Algorithm

DOI10.3233/FI-2013-813zbMath1285.68225OpenAlexW1917991439MaRDI QIDQ5300618

Andrzej Mróz

Publication date: 27 June 2013

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2013-813

zbMATH Keywords

algorithmcomputational complexitydecompositionGaussian eliminationcomputer algebramoduleisomorphism problemGAPcommon direct summand

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Related Items (2)

Inflation algorithm for loop-free non-negative edge-bipartite graphs of corank at least two ⋮ On the normal forms of modules with respect to parametrizing bimodules.

Uses Software

• GAP

This page was built for publication: On the Computational Complexity of Bongartz's Algorithm