dc.contributor.author | Goldberg, LA | en_US |
dc.contributor.author | Jerrum, M | en_US |
dc.date.accessioned | 2015-02-25T16:11:53Z | |
dc.date.accessioned | 2015-06-03T10:50:14Z | |
dc.date.issued | 2014 | en_US |
dc.identifier.issn | 0097-5397 | en_US |
dc.identifier.other | 6 | |
dc.identifier.uri | http://qmro.qmul.ac.uk/xmlui/handle/123456789/7564 | |
dc.description | (c) 2014 Society for Industrial and Applied Mathematics | |
dc.format.extent | 1921 - 1952 | en_US |
dc.relation.ispartof | SIAM JOURNAL ON COMPUTING | en_US |
dc.relation.replaces | http://qmro.qmul.ac.uk/jspui/handle/123456789/6761 | |
dc.relation.replaces | 123456789/6761 | |
dc.subject | computational complexity | en_US |
dc.subject | Tutte polynomial | en_US |
dc.subject | #P-completeness | en_US |
dc.title | THE COMPLEXITY OF COMPUTING THE SIGN OF THE TUTTE POLYNOMIAL | en_US |
dc.type | Article | |
dc.identifier.doi | 10.1137/12088330X | en_US |
pubs.author-url | http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000346845600004&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=612ae0d773dcbdba3046f6df545e9f6a | en_US |
pubs.issue | 6 | en_US |
pubs.notes | Not known | en_US |
pubs.publication-status | Published | en_US |
pubs.volume | 43 | en_US |