Paper 11:  Computing the primitive permutation groups of degree less than 1000
           by Colva M. Roney-Dougal and William R. Unger

The code for this paper takes around 700 seconds to run on a
64-bit 2.6GHz AMD processor.

Changes since book release:

V2.11:  Two functions in Paper11_funcs have been altered slightly from
        the code shown in the paper.

        The IsGLConjugate function has been modified slightly so that
        it first executes the NotConjTest call that previously was
        done after some set-up for IsGLConjugate.  This avoids many
        repetitions of the set-up.

        The other change is within NotConjTest.  After both H and K have
        been determined to be soluble with matching conjugacy class sizes,
        when H is small (#H le 1000) we now test H and K for isomorphism
        using pc-presentations of both.  If they are not isomorphic, then
        we know they are not conjugate.

        These changes have reduced the time taken for the GL(4,5) run
        from about 16,000s to the vicinity of 800s (using a 64-bit AMD
        processor running at 2.4 GHz).  Most of the reduction in
        execution time is due to the isomorphism test in NotConjTest.