The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation)
Attributed to:
Computational Counting
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-31594-7_34
Publication URI: http://dx.doi.org/10.1007/978-3-642-31594-7_34
Type: Book Chapter
Book Title: Automata, Languages, and Programming (2012)
Page Reference: 399-410
ISBN: 978-3-642-31593-0