Computing Irreducible Representations of Supersolvable Groups

@inproceedings{Clausen2010ComputingIR,
  title={Computing Irreducible Representations of Supersolvable Groups},
  author={Michael Clausen},
  year={2010}
}
Recently, it has been shown that the ordinary irreducible representations of a supersolvable group G of order n given by a power-commutator presentation can be constructed in time 0(n2 log«). We present an improved algorithm with running time 0(n log/?).