Asymptotic Enumeration of Tournaments with a Given Score Sequence

We obtain the asymptotic number of labeled trounaments with a given score sequence in the case where each score isn/2+O(n3/4+ε) for sufficiently smallε>0. Some consequences for the score sequences of random tournaments are also noted. The method used is integration inncomplex dimensions.