Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials

We consider the problem of approximating certain combinatorial polynomials. First, we consider the problem of approximating the Tutte polynomial of a binary matroid with parameters q>= 2 and gamma. (Relative to the classical (x,y) parameterisation, q=(x-1)(y-1) and gamma=y-1.) A graph is a specia...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Goldberg, Leslie Ann, Jerrum, Mark
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 02.04.2012
Subjects:	Approximation Binary codes Combinatorial analysis Complexity Mathematical analysis Parameterization Permutations Polynomials Weight
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!