论文信息 - Note on Counting Eulerian Circuits - 字舞流文

Note on Counting Eulerian Circuits

We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P.

Peter Winkler | Graham R. Brightwell

[1] Lucan,et al. 7 = 8 M , 1993 .

[2] Peter Winkler,et al. On the number of Eulerian orientations of a graph , 1996 .

[3] W. T. Tutte. Graph Theory , 1984 .

[4] Leslie G. Valiant,et al. The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[5] Seinosuke Toda. On the computational power of PP and (+)P , 1989, 30th Annual Symposium on Foundations of Computer Science.

[6] Nadia Creignou,et al. Complexity of Generalized Satisfiability Counting Problems , 1996, Inf. Comput..

[7] Peter Winkler,et al. Counting linear extensions is #P-complete , 1991, STOC '91.

[8] G. Brightwell,et al. Counting linear extensions , 1991 .

[9] M. Jerrum. Counting, Sampling and Integrating: Algorithms and Complexity , 2003 .

[10] Peter Winkler,et al. On the number of Eulerian orientations of a graph , 2005, Algorithmica.

[11] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[12] E. Wright,et al. An Introduction to the Theory of Numbers , 1939 .

[13] N. Linial. Hard enumeration problems in geometry and combinatorics , 1986 .