✦ LIBER ✦

The Parameterized Complexity of Counting Problems

✍ Scribed by Flum, Jörg; Grohe, Martin

Book ID: 118181239
Publisher: Society for Industrial and Applied Mathematics
Year: 2004
Tongue: English
Weight: 347 KB
Volume: 33
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539703427203

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parameterized complexity of generalized

Parameterized complexity of generalized domination problems

✍ Petr A. Golovach; Jan Kratochvíl; Ondřej Suchý 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 376 KB

Parameterized complexity of constraint s

Parameterized complexity of constraint satisfaction problems

✍ Dániel Marx 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 285 KB

The Complexity of Planar Counting Proble

The Complexity of Planar Counting Problems

✍ Hunt, Harry B.; Marathe, Madhav V.; Radhakrishnan, Venkatesh; Stearns, Richard E 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 436 KB

Parameterized Complexity of Arc-Weighted

Parameterized Complexity of Arc-Weighted Directed Steiner Problems

✍ Guo, Jiong; Niedermeier, Rolf; Suchý, Ondřej 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 280 KB

The Relative Complexity of Approximate C

The Relative Complexity of Approximate Counting Problems

✍ Martin Dyer; Leslie Ann Goldberg; Catherine Greenhill; Mark Jerrum 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 295 KB

Complexity of Generalized Satisfiability

Complexity of Generalized Satisfiability Counting Problems

✍ Nadia Creignou; Miki Hermann 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 698 KB