Return to search

The complexity of counting problems

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).

Identiferoai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:239326
Date January 1994
CreatorsAnnan, J. D.
ContributorsWelsh, D. J. A.
PublisherUniversity of Oxford
Source SetsEthos UK
Detected LanguageEnglish
TypeElectronic Thesis or Dissertation
Sourcehttp://ora.ox.ac.uk/objects/uuid:52070098-14fa-4cf1-ae6e-9f9ce6a626d8

Page generated in 0.0013 seconds