📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

The Complexity of Computing the Sign of the Tutte Polynomial (2014)

First Author: Goldberg L

Attributed to: Computational Counting funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1137/12088330x

Publication URI: http://dx.doi.org/10.1137/12088330x

Type: Journal Article/Review

Parent Publication: SIAM Journal on Computing

Issue: 6