Counting Eulerian Circuits is #P-Complete.

Graham R. Brightwell, Peter Winkler

Browse the full ALENEX paper archive.