scientific article; zbMATH DE number 3906730

From MaRDI portal
Publication:3684301





[For the entire collection see Zbl 0536.00004.] The paper describes a way of saving space in a computer implementation of the coset enumeration algorithm. The idea is that when collapses or coincidences occur, the information on further collapses can be stored in space that becomes available in the multiplication table. The paper also suggests other steps that can be taken if one runs out of space in coset enumeration.











This page was built for publication:

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