Randomized Approximations of Parameterized Counting Problems
From MaRDI portal
Publication:3499723
DOI10.1007/11847250_5zbMath1154.68433OpenAlexW1570607879MaRDI QIDQ3499723
Publication date: 3 June 2008
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11847250_5
Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (9)
A Basic Parameterized Complexity Primer ⋮ Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle ⋮ Parameterized Derandomization ⋮ Parameterized random complexity ⋮ Confronting intractability via parameters ⋮ The parameterized complexity of probability amplification ⋮ A fixed-parameter perspective on \#BIS ⋮ On the parameterized complexity of approximate counting ⋮ Unnamed Item
This page was built for publication: Randomized Approximations of Parameterized Counting Problems
