课题基金 / 基金详情

Logic and computational complexity

Logic and computational complexity
逻辑和计算复杂性
批准号:
105666-2011
负责人:
Urquhart, Alasdair
金额:
$2.11万
依托单位:
依托单位国家:
加拿大
项目类别:
Discovery Grants Program - Individual
财政年份:
2012
资助国家:
加拿大
项目状态:
已结题
起止时间:
2012-01-01 至 2013-12-31

项目摘要

项目成果

Urquhart, Alasdair的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
The principal aim of my research is to understand the limitations of computer programs in solving certain important types of problems. These problems are ones where there are a certain number of conditions to be satisfied; assuming a given collection of conditions, it is easy to check whether or not a proposed solution is in fact correct, but it appears to be difficult to search for a solution. An everyday example of this kind of problem is provided by puzzles, such as jigsaw puzzles, or the problem of solving Rubik's Cube. These type of problems are in the category NP. Of these, the best known is the Satisfiability problem from logic, which is the problem of whether a formula of propositional logic has a satisfying assignment.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Logic and computational complexity
  • 批准号:
    105666-2011
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $2.11万
  • 财政年份:
    2015
  • 负责人:
    Urquhart, Alasdair
  • 依托单位:
Logic and computational complexity
  • 批准号:
    105666-2011
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $2.11万
  • 财政年份:
    2014
  • 负责人:
    Urquhart, Alasdair
  • 依托单位:
Logic and computational complexity
  • 批准号:
    105666-2011
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $2.11万
  • 财政年份:
    2013
  • 负责人:
    Urquhart, Alasdair
  • 依托单位:
Logic and computational complexity
  • 批准号:
    105666-2011
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $2.11万
  • 财政年份:
    2011
  • 负责人:
    Urquhart, Alasdair
  • 依托单位:
国内基金
海外基金
物体运动对流场扰动的数学模型研究
  • 批准号:
    51072241
  • 项目类别:
    专项基金项目
  • 资助金额:
    10.0万元
  • 批准年份:
    2010
  • 负责人:
    李廷秋
  • 依托单位:
Computational Methods for Analyzing Toponome Data