课题基金 / 基金详情

New Directions in Proof Complexity and Communication Complexity

New Directions in Proof Complexity and Communication Complexity
证明复杂性和通信复杂性的新方向
批准号:
228106-2012
负责人:
Pitassi, Toniann
金额:
$5.68万
依托单位:
依托单位国家:
加拿大
项目类别:
Discovery Grants Program - Individual
财政年份:
2014
资助国家:
加拿大
项目状态:
已结题
起止时间:
2014-01-01 至 2015-12-31

项目摘要

项目成果

Pitassi, Toniann的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
The central problem in computational complexity is to understand which computational problems can be solved efficiently, and to develop the most efficient algorithms for such problems. The question of whether the NP-complete problems have efficient solutions, known as the P versus NP question, is the driving force behind my research. It is a beautiful and deep question, and its solution would have profound consequences.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
New Directions in Complexity Theory
  • 批准号:
    RGPIN-2017-06399
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $8.74万
  • 财政年份:
    2021
  • 负责人:
    Pitassi, Toniann
  • 依托单位:
New Directions in Complexity Theory
  • 批准号:
    RGPIN-2017-06399
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $4.37万
  • 财政年份:
    2020
  • 负责人:
    Pitassi, Toniann
  • 依托单位:
New Directions in Complexity Theory
  • 批准号:
    DGDND-2017-00092
  • 项目类别:
    DND/NSERC Discovery Grant Supplement
  • 资助金额:
    $2.91万
  • 财政年份:
    2019
  • 负责人:
    Pitassi, Toniann
  • 依托单位:
New Directions in Complexity Theory
  • 批准号:
    RGPIN-2017-06399
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $4.37万
  • 财政年份:
    2019
  • 负责人:
    Pitassi, Toniann
  • 依托单位:
海外基金