Counting eulerian circuits is #P-complete

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics

Volumn , Issue , 2005, Pages 259-262

  Brightwell, Graham R ^a   Winkler, Peter ^b  

^a LONDON SCHOOL OF ECONOMICS   (United Kingdom)

^b Dartmouth College   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS;

EULERIAN CIRCUITS; UNDIRECTED GRAPH;

PROBLEM SOLVING;

EID: 32144462654     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. G.R. Brightwell and P. Winkler, Counting linear extensions is #P-complete, extended abstract, Proc. 23rd ACM Symp. on the Theory of Computing (1991) 175-181.
2. G.R. Brightwell and P. Winkler, Counting linear extensions, ORDER 8 #3 (1991) 225-242.
3. N. Creignou and M. Hermann, Complexity of generalized satisfiability counting problems, Information and Computation 25 #1 (Feb. 1996) 1-12.
4. G.H. Hardy and E.M. Wright, An Introduction to the Theory of Numbers, 4th Ed., Oxford University Press 1960.
5. M. Jerrum, Counting, Sampling and Integrating: Algorithms and Complexity, Lectures in Mathematics, ETH Zrich, Birkhuser Verlag, Basel, 2003.
6. N. Linial, Hard enumeration problems in geometry and combinatorics, SIAM J. Alg. Disc. Meth. 7 No. 2 (1986) 331-335.
7. M. Mihail and P. Winkler, On the number of Eulerian orientations of a graph, extended abstract, Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms (1992) 138-145.
8. M. Mihail and P. Winkler, On the number of Eulerian orientations of a graph, Algorithmica 16 (1996) 402-414.
9. S. Toda, On the computational power of PP and +P, Proc. 30th IEEE Symposium on Foundations of Computer Science (1989) 514-519.
10. W.T. Tutte, Graph Theory, Addison-Wesley, New York, 1984.
11. L.G. Valiant, The complexity of computing the permanent, Theoret. Comput. Sci. 8 (1979) 189-201.
12. L.G. Valiant, The complexity of enumeration and reliability problems, SIAM J. Comput. 8 (1979) 410-421.