34 citations · 55 across the 5 of their papers we have counts for
1 paper · 1 filter
Graham R. Brightwell, Peter Winkler
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.