"The Complexity of Computing the Sign of the Tutte Polynomial (and ..."

Leslie Ann Goldberg, Mark Jerrum (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-31594-7_34

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icalp/GoldbergJ12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/GoldbergJ12
Leslie Ann Goldberg, Mark Jerrum:
The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation). ICALP (1) 2012: 399-410

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.