“…The algorithms of [21] have a complexity of O(p + e 2ω log 2 p), where 2 ≤ ω < 3 is the exponent of matrix multiplication, see [31,Chapter 12]. In the special case of groups in H 2 p,e , Brooksbank, Maglione, and the author give an O(p 3 + e ω log 2 p)-time algorithm [7]. Note that it takes Ω(e 2 log 2 p) bits to input the groups in H 2 p,e by any of the standard methods, including matrices, presentations, or permutations.…”