Counting the number of Hamilton cycles in random digraphs

Abstract: "We show that there exists a a [sic] fully polynomial randomized approximation scheme for counting the number of Hamilton cycles in almost all directed graphs."