Computing the character table of a large group may, of course, take a very
long time. But if I'm just interested in a few characters (like, for
instance, the irreducible characters of degree n for some fixed n or the
faithful irreducible characters), if there some faster way to compute
them than computing the whole character table?