Parameterized Algorithm Design and Complexity Analysis: New Methods and Strategic Applications in the FPT Algorithmic Server Project
Parameterized Algorithm Design and Complexity Analysis: New Methods and Strategic Applications in the FPT Algorithmic Server Project
参数化算法设计与复杂度分析：FPT算法服务器项目中的新方法与策略应用
批准号：
DP0344762
负责人：
Prof Michael Fellows
金额：
$4.1万
依托单位国家：
澳大利亚
项目类别：
Discovery Projects
财政年份：
2003
资助国家：
澳大利亚
项目状态：
已结题
起止时间：
2003-01-01 至 2007-12-31
中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
A fundamental discovery of the first decades of computer science is that completely efficient (polynomial time) algorithms probably do not exist for thousands of natural computational problems. The project will result in new methods for designing and analyzing algorithms for hard problems with natural parameters, and in improved
algorithms for these problems.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Multivariate Algorithmics: Meeting the Challenge of Real World computational complexity
-
批准号：DP1097129
-
项目类别：Discovery Projects
-
资助金额：$36.18万
-
财政年份：2010
-
负责人：Prof Michael Fellows
-
依托单位：
海外基金
