On Parameterized Intractability
Periodicals（2008）
摘要
AbstractWe study the theory and techniques developed in the research of parameterized intractability, emphasizing on parameterized hardness and completeness that imply (stronger) computational lower bounds for natural computational problems. Moreover, the fundamentals of the structural properties in parameterized complexity theory, relationships to classical complexity theory and more recent developments in the area are also introduced.
更多查看译文
关键词
parameterized intractability,natural computational problem,parameterized hardness,parameterized complexity theory,recent development,lower bound,structural property,classical complexity theory
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要