Counting Eulerian circuits is #P-complete

(2005) Counting Eulerian circuits is #P-complete. In: Workshop on analytic algorithmics and combinatorics, 2005-01-22, Vancouver,Canada,CAN.

Copy

Item Type	Conference or Workshop Item (Paper)
Departments	Mathematics
Date Deposited	04 Nov 2008 14:54
URI	https://researchonline.lse.ac.uk/id/eprint/8282

Full text not available from this repository.

Atom

BibTeX

OpenURL ContextObject in Span

OpenURL ContextObject

Dublin Core

MPEG-21 DIDL

Data Cite XML

EndNote

HTML Citation

METS

MODS

RIOXX2 XML

Reference Manager

Refer

ASCII Citation

Export

Downloads