Inapproximability of the Tutte polynomial of a planar graph (2012)
Attributed to:
Computational Counting
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/s00037-012-0046-4
Publication URI: http://dx.doi.org/10.1007/s00037-012-0046-4
Type: Journal Article/Review
Parent Publication: computational complexity
Issue: 4