课题基金 / 基金详情

Algorithmic and Computational Graph Theory and Game Theory

Algorithmic and Computational Graph Theory and Game Theory
算法和计算图论和博弈论
批准号:
356035-2013
负责人:
Farzad, Babak
金额:
$1.09万
依托单位:
依托单位国家:
加拿大
项目类别:
Discovery Grants Program - Individual
财政年份:
2014
资助国家:
加拿大
项目状态:
已结题
起止时间:
2014-01-01 至 2015-12-31

项目摘要

项目成果

Farzad, Babak的其他基金

相似基金

相关文献

中文摘要
翻译
计算机科学中的基本问题围绕着高效算法的发现。在许多情况下,设计快速算法或证明不存在快速算法密切依赖于问题的几何和图论特征。长期以来,图论一直被认为是形式化研究此类问题最富有成效的领域之一。
英文摘要
Fundamental problems in computer science revolve around the discovery of efficient algorithms. Designing fast algorithms or proving that no fast algorithm exists intimately relies, in many cases, on geometrical and graph theoretic characteristics of the problem. Graph Theory has long been recognized as one of the most fruitful fields for the formal study of such problems.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Algorithmic and Computational Graph Theory and Game Theory
  • 批准号:
    356035-2013
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.09万
  • 财政年份:
    2017
  • 负责人:
    Farzad, Babak
  • 依托单位:
Algorithmic and Computational Graph Theory and Game Theory
  • 批准号:
    356035-2013
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.09万
  • 财政年份:
    2016
  • 负责人:
    Farzad, Babak
  • 依托单位:
Algorithmic and Computational Graph Theory and Game Theory
  • 批准号:
    356035-2013
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.09万
  • 财政年份:
    2015
  • 负责人:
    Farzad, Babak
  • 依托单位:
Algorithmic and Computational Graph Theory and Game Theory
  • 批准号:
    356035-2013
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $1.09万
  • 财政年份:
    2013
  • 负责人:
    Farzad, Babak
  • 依托单位:
国内基金
海外基金
Computational Methods for Analyzing Toponome Data