SIAM (2005) Counting Eulerian circuits is #P-complete. In: Workshop on analytic algorithmics and combinatorics, 2005-01-22, Vancouver, Canada.
Full text not available from this repository.| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Official URL: | http://www.siam.org/meetings/analco05/program.htm |
| Additional Information: | © 2005 the authors |
| Divisions: | Mathematics |
| Subjects: | Q Science > QA Mathematics |
| Date Deposited: | 04 Nov 2008 14:54 |
| Last Modified: | 21 Jan 2024 05:03 |
| URI: | http://eprints.lse.ac.uk/id/eprint/8282 |
Actions (login required)
 |
View Item |
