Graham Brightwell, Peter Winkler. Counting Eulerian Circuits is #P-Complete. In Camil Demetrescu, Robert Sedgewick, Roberto Tamassia, editors, Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, ALENEX /ANALCO 2005, Vancouver, BC, Canada, 22 January 2005. pages 259-262, SIAM, 2005. [doi]
Abstract is missing.