Cookies?
Library Header Image
LSE Research Online LSE Library Services

Counting Eulerian circuits is #P-complete

Brightwell, Graham and Winkler, Peter (2005) Counting Eulerian circuits is #P-complete. In: Workshop on analytic algorithmics and combinatorics, 22 Jan 2005, 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
Subjects: Q Science > QA Mathematics
Sets: Departments > Mathematics
Date Deposited: 04 Nov 2008 14:54
Last Modified: 01 Oct 2010 09:00
URI: http://eprints.lse.ac.uk/id/eprint/8282

Actions (login required)

View Item View Item