Brightwell, Graham and Winkler, Peter (2005) Counting Eulerian circuits is #P-complete. In: Workshop on analytic algorithmics and combinatorics, 22 Jan 2005, Vancouver, Canada.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Official URL: | http://www.siam.org/meetings/analco05/program.htm |
| Additional Information: | © 2005 the authors |
| Library of Congress subject classification: | Q Science > QA Mathematics |
| Sets: | Departments > Mathematics |
| Date Deposited: | 04 Nov 2008 14:54 |
| URL: | http://eprints.lse.ac.uk/8282/ |
Actions (login required)
 |
Record administration - authorised staff only |
