[DMANET] BEATCS Algorithmics Column: Approximate counting using Taylor's theorem

The Algorithmics Column in the latest Bulletin of the EATCS (number 138, available a
http://bulletin.eatcs.org/index.php/beatcs/issue/view/40) features the following article:

Viresh Patel and Guus Regts: Approximate counting using Taylor's theorem: a survey

Other recent contributions featured in the Algorithmics Column were:

William Gasarch: Hilbert's Tenth Problem for Fixed d and n
(in Bulletin No 133)

Kathie Cameron and Kristina Vuskovic: Hadwiger's Conjecture for some hereditary classes of graphs: a survey
(in Bulletin No 131)

Yann Strozecki: Enumeration Complexity
(in Bulletin No 129)

Katarína Cechlárová, Ágnes Cseh, David Manlove: Selected open problems in Matching Under Preferences
(in Bulletin No 128)

The bulletins are all freely available here: https://eatcs.org/index.php/on-line-issues

If you have ideas for a potential contribution to the Algorithmics Column, please
feel free to contact me (thomas.erlebach@durham.ac.uk) with suggestions or
proposals.

Best regards,

Thomas Erlebach

**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************