Note on Counting Eulerian Circuits
Abstract
We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.