A Fixed-Parameter Perspective on #BIS

The problem of (approximately) counting the independent sets of a bipartite graph (#BIS) is the canonical approximate counting problem that is complete in the intermediate complexity class # RH Π 1 . It is believed that #BIS does not have an efficient approximation algorithm but also that it is not...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 81; číslo 10; s. 3844 - 3864
Hlavní autoři:	Curticapean, Radu, Dell, Holger, Fomin, Fedor, Goldberg, Leslie Ann, Lapinskas, John
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.10.2019 Springer Nature B.V
Témata:	Algorithm Analysis and Problem Complexity Algorithms Apexes Approximation Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Mathematical analysis Mathematics of Computing Parameterization Parameters Polynomials Special Issue: Parameterized and Exact Computation Theory of Computation Parameterised complexity Independent sets Approximate counting
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!