Randomized approximations of parameterized counting problems
PARAMETERIZED AND EXACT COMPUTATION,PROCEEDINGS（2006）
摘要
We prove that each parameterized counting problem in the class #[P] has a randomized fpt approximation algorithm using a W[P] oracle. Analoguous statements hold for #W[t] and #A[t] for each t≥1. These results are parameterized analogues of a theorem due to O.Goldreich and L.Stockmeyer.
更多查看译文
关键词
parameterized analogue,randomized approximation,analoguous statement,parameterized counting problem,randomized fpt approximation algorithm
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要