The complexity of fixed-parameter problems: guest column.

ACM SIGACT News(2008)

引用 3|浏览10
暂无评分
摘要
We describe how to found and develop the theory of fixed-parameter complexity and hardness in a manner both fully analgous to the classical theory of NP -completeness and much simpler than the original development. We present some recent advance made using this approach.
更多
查看译文
关键词
complexity,problems,fixed-parameter
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要