课题基金 / 基金详情

Algorithms and complexity of the constraint satisfaction problem

Algorithms and complexity of the constraint satisfaction problem
约束满足问题的算法和复杂度
批准号:
313357-2010
负责人:
Bulatov, Andrei
金额:
$3.13万
依托单位:
依托单位国家:
加拿大
项目类别:
Discovery Grants Program - Individual
财政年份:
2012
资助国家:
加拿大
项目状态:
已结题
起止时间:
2012-01-01 至 2013-12-31

项目摘要

项目成果

Bulatov, Andrei的其他基金

相似基金

相关文献

中文摘要
翻译
约束满足问题(CSP)的目标是找到对给定变量集的赋值,该赋值受制于可同时赋值给特定变量子集的值的约束。在其计票版本(#CSP)中,目标是找出或近似计算这类分配的数量。CSP和#CSP可以用来对计算机科学、离散数学、人工智能和其他领域中的各种计算问题进行建模,它们在这些领域已经找到了大量的应用。
英文摘要
The aim in a constraint satisfaction problem (CSP) is to find an assignment of values to a given set of variables, subject to constraints on the values which can be assigned simultaneously to certain specified subsets of variables. In its counting version (#CSP) the goal is to find or approximate the number of such assignments. CSP and #CSP can be used to model a wide variety of computational problems in computer science, discrete mathematics, artificial intelligence, and elsewhere, they have found numerous applications in those areas.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Applications of algebraic methods in combinatorial problems
  • 批准号:
    RGPIN-2020-05481
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $4.66万
  • 财政年份:
    2022
  • 负责人:
    Bulatov, Andrei
  • 依托单位:
Applications of algebraic methods in combinatorial problems
  • 批准号:
    RGPIN-2020-05481
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $4.66万
  • 财政年份:
    2021
  • 负责人:
    Bulatov, Andrei
  • 依托单位:
Applications of algebraic methods in combinatorial problems
  • 批准号:
    RGPIN-2020-05481
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $4.66万
  • 财政年份:
    2020
  • 负责人:
    Bulatov, Andrei
  • 依托单位:
The complexity of the constraint satisfaction problem and its variants
  • 批准号:
    RGPIN-2015-04656
  • 项目类别:
    Discovery Grants Program - Individual
  • 资助金额:
    $3.13万
  • 财政年份:
    2019
  • 负责人:
    Bulatov, Andrei
  • 依托单位:
海外基金