34 citations · 79 across the 6 of their papers we have counts for
1 paper · 2 filters
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.