On parameterized counting

MaRDI QIDQ3539937zbMATH OpenFDO

Authors J. Andres Montoya

Publication date 19 November 2008

Full work available at URL http://d-nb.info/990364100/34

zbMATH Keywords

approximation of counting problemsparameterized complexity

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the parameterized complexity of approximate counting
• Randomized Approximations of Parameterized Counting Problems
• Parameterized counting problems
• scientific article; zbMATH DE number 1929968
• The Parameterized Complexity of Counting Problems

Cited in

(10)

• On the power of enumerative counting
• Parameterized counting problems
• Randomized Approximations of Parameterized Counting Problems
• Counting Parameterized Border Arrays for a Binary Alphabet
• The Parameterized Complexity of Counting Problems
• scientific article; zbMATH DE number 1929968 (Why is no real title available?)
• Counting CTL
• Parameterized analogues of probabilistic computation
• On the parameterized complexity of approximate counting
• Compactors for parameterized counting problems

This page was built for publication: On parameterized counting

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