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

parameterized complexityapproximation of counting problems

Mathematics Subject Classification ID

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

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)

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