Algorithms in the W-Hierarchy

Theory of Computing Systems（2007）

引用 6|浏览0

暂无评分

摘要

We show new upper bounds for problems in the W-hierarchy of fixed-parameter complexity. A crucial ingredient of our proofs is an extension to the W-RAM model, which permits more-powerful operations but remains equivalent to the original. We use the extended model to give new upper bounds for Subsetsum, Maximum Irredundant Set, and various problems concerning intersection of finite-state machines.

查看译文

关键词

Binary Search,Conditional Test,Circuit Family,Check Phase,Valid Assignment

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要