Corporate creators

Number of items: 1.
SIAM (2005-01-22) Counting Eulerian circuits is #P-complete [Paper]. Workshop on analytic algorithmics and combinatorics, Vancouver, Canada, CAN.