On the computational complexity of Bongartz's algorithm

DOI10.3233/FI-2013-813zbMATH Open1285.68225OpenAlexW1917991439MaRDI QIDQ5300618FDOQ5300618

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1253966
• scientific article; zbMATH DE number 5159100
• Testing isomorphism of modules.
• Combinatorial algorithms for computing degenerations of modules of finite dimension
• The module isomorphism problem reconsidered.

zbMATH Keywords

computational complexityGaussian eliminationdecompositionalgorithmcomputer algebraisomorphism problemmoduleGAPcommon direct summand

Mathematics Subject Classification ID

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

Cited In (5)

• Inflation algorithm for loop-free non-negative edge-bipartite graphs of corank at least two
• Title not available (Why is that?)
• On the normal forms of modules with respect to parametrizing bimodules.
• Correctness and concurrent complexity of the black-white bakery algorithm
• Title not available (Why is that?)

Uses Software

• GAP

This page was built for publication: On the computational complexity of Bongartz's algorithm

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