Library Header Image
LSE Research Online LSE Library Services

Counting Eulerian circuits is #P-complete

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:
Additional Information: © 2005 the authors
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Date Deposited: 04 Nov 2008 14:54
Last Modified: 20 Sep 2021 01:52

Actions (login required)

View Item View Item