Note on Counting Eulerian Circuits
Graham R. Brightwell, Peter Winkler
cs.CCarXiv:cs/0405067
Abstract
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.
Create a lesson
Related papers
The determinantal complexity of the 4*4 permanent is 15
Karthik Sheshadri
A Width Hierarchy of Monotone Algebraic Branching Programs
Julian Dörfler, Alexander Rogovskyy
Mortality Is Undecidable for 2 × 2 Integer Matrices
Thanin Quartz, Ivan O. Shevchenko, Hans De Sterck et al.
Fourier Entropy Bounds via Approximations
Manaswi Paraashar, Nitin Saurabh
An Engineering Reading of the Bounded Halting Problem and Observable Properties of a Universal Machine
Sergey Salishev
Exhaustive Search Is Hard to Beat in Constant Depth for Hyperclique and Orthogonal Vectors
Nikolai Chukhin