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

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Goldberg, Leslie Ann, Jerrum, Mark
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 02.04.2012
Predmet:	Approximation Binary codes Combinatorial analysis Complexity Mathematical analysis Parameterization Permutations Polynomials Weight
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!