课题基金 / 基金详情

Towards a finer classification of the complexity of constraint satisfaction problems

Towards a finer classification of the complexity of constraint satisfaction problems
对约束满足问题的复杂性进行更精细的分类
批准号:
312397-2008
负责人:
Tesson, Pascal
金额:
$1.75万
依托单位:
依托单位国家:
加拿大
项目类别:
Discovery Grants Program - Individual
财政年份:
2012
资助国家:
加拿大
项目状态:
已结题
起止时间:
2012-01-01 至 2013-12-31

项目摘要

项目成果

Tesson, Pascal的其他基金

相似基金

相关文献

中文摘要
翻译
该方案的主要目的是继续研究约束满足问题(CSP)的计算复杂性。CSP提供了一个统一的框架来分析在计算机科学的许多领域中自然出现的各种计算问题,最显著的是在人工智能、数据库理论和组合优化方面。
英文摘要
The main objective of the proposal is the continued study of the computational complexity of constraint satisfaction problems (CSP). CSP offer a unified framework to analyze a wide variety of computational problems that occur naturally in many areas of computer science, most notably in artificial intelligence, database theory and combinatorial optimization.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Towards a finer classification of the complexity of constraint satisfaction problems
  • 批准号:
    312397-2008
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.75万
  • 财政年份:
    2011
  • 负责人:
    Tesson, Pascal
  • 依托单位:
Towards a finer classification of the complexity of constraint satisfaction problems
  • 批准号:
    312397-2008
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.75万
  • 财政年份:
    2010
  • 负责人:
    Tesson, Pascal
  • 依托单位:
Towards a finer classification of the complexity of constraint satisfaction problems
  • 批准号:
    312397-2008
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.75万
  • 财政年份:
    2009
  • 负责人:
    Tesson, Pascal
  • 依托单位:
Towards a finer classification of the complexity of constraint satisfaction problems
  • 批准号:
    312397-2008
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.75万
  • 财政年份:
    2008
  • 负责人:
    Tesson, Pascal
  • 依托单位:
海外基金