Parameterized counting problems

DOI10.1007/3-540-45687-2_46MaRDI QIDQ4708603zbMATH OpenFDO

Authors Catherine McCartin

Publication date 18 June 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2420/24200556.htm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Recommendations

• Parameterized counting problems
• The Parameterized Complexity of Counting Problems
• Counting problems in parameterized complexity
• On the parameterized complexity of approximate counting
• On parameterized counting

Cited in

(14)

• Parameterized counting problems
• On parameterized counting
• Counting complexity
• Approximation algorithms for some parameterized counting problems
• The Parameterized Complexity of Counting Problems
• Counting problems in parameterized complexity
• On the parameterized complexity of approximate counting
• Parameter compilation
• Parameterised counting in logspace
• The complexity of counting homomorphisms seen from the other side
• Parameterised counting in logspace
• Compactors for parameterized counting problems
• Efficient algorithms for counting parameterized list H-colorings
• The parameterized complexity of probability amplification

This page was built for publication: Parameterized counting problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4708603)