Use this URL to cite or link to this record in EThOS:
Title: The complexity of counting problems
Author: Annan, J. D.
ISNI:       0000 0001 3424 8889
Awarding Body: University of Oxford
Current Institution: University of Oxford
Date of Award: 1994
Availability of Full Text:
Access from EThOS:
Full text unavailable from EThOS. Please try the link below.
Access from Institution:
Theorem: For any rational x ≥ 1, there exists a fully polynomial randomised approximation scheme for evaluating the Tutte polynomial of dense graphs at the point (x,1).
Supervisor: Welsh, D. J. A. Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: Graph theory ; Research