Counting Eulerian circuits is #P-complete
SIAM
(2005-01-22)
Counting Eulerian circuits is #P-complete
[Paper]. Workshop on analytic algorithmics and combinatorics, Vancouver, Canada, CAN.
| Item Type | Conference or Workshop Item (Paper) |
|---|---|
| Copyright holders | © 2005 the authors |
| Departments | LSE > Academic Departments > Mathematics |
| Date Deposited | 4 November 2008 |
| URI | https://researchonline.lse.ac.uk/id/eprint/8282 |
Explore Further
- http://www.siam.org/meetings/analco05/papers/09grbrightwell.pdf (Publisher)
- https://www.scopus.com/pages/publications/32144462654 (Scopus publication)
- http://www.siam.org/meetings/analco05/program.htm (Official URL)