"The computational complexity of approximation of partition functions."

Colin McQuillan (2013)

> Home

Details and statistics

DOI: —

access: closed

type: Book or Thesis

metadata version: 2022-04-05

- view
  - electronic edition @ liv.ac.uk
  - electronic edition @ bl.uk
- export record
  dblp key:
  - phd/ethos/McQuillan13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/ethos/McQuillan13
Colin McQuillan:
The computational complexity of approximation of partition functions. University of Liverpool, UK, 2013

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.