课题基金 / 基金详情

AF: Small: Geometric Complexity Theory Approach to the P vs NP problem

AF: Small: Geometric Complexity Theory Approach to the P vs NP problem
AF:小:P 与 NP 问题的几何复杂性理论方法
批准号:
1017760
负责人:
Ketan Mulmuley
金额:
$48.57万
依托单位:
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2010
资助国家:
美国
项目状态:
已结题
起止时间:
2010-08-01 至 2015-07-31

项目摘要

项目成果

Ketan Mulmuley的其他基金

相似基金

相关文献

中文摘要
翻译
本项目开发了解决P vs. NP问题的几何方法,称为几何复杂性理论。P vs. NP问题是数学科学的基本猜想,它说定理证明不能自动化。几何复杂性理论(GCT)是通过代数几何和表示理论来解决这个问题和相关问题的方法。这种方法将这些问题在复数领域的变体减少到证明障碍物存在的问题,障碍物是代数几何和表示论中的对象,可以作为所考虑的下限问题的硬度证明。这些障碍的存在与代数几何和表示论中的某些正性假设密切相关。本项目的目标是深入研究复杂性理论中的困难性和数学中的积极性之间的联系,从而进一步扩展这一方法。由于科学和工程中易处理和难处理问题之间的界限取决于P vs. NP问题,因此本项目所进行的研究对复杂性理论以及其他几个科学和工程领域具有重要的智力意义。此外,由于GCT揭示了复杂性理论中的P vs. NP和相关问题以及纯数学中的基本正性问题之间的深刻联系,因此这项研究可能会导致复杂性理论与代数几何和表示论等几个数学分支之间的广泛合作。
英文摘要
This project develops a geometric approach to the P vs. NP problem, called geometric complexity theory.The P vs. NP problem is the foundational conjecture of mathematical sciences, which says that theorem proving cannot be automated. Geometric complexity theory (GCT) is an approach to this and related problems via algebraic geometry and representation theory. This approach reduces variants of these problems over the field of complex numbers to the problem of proving existence of obstructions, which are objects in algebraic geometry and representation theory that serve as proof certificates of hardness in the lower bound problems under consideration. The existence of these obstructions is deeply connected with certain positivity hypotheses in algebraic geometry and representation theory. The goal of this project is to study this connection between hardness in complexity theory and positivity in mathematics in depth and thereby extend the approach further.Since the boundary between the tractable and intractable problems in science and engineering depends on the P vs. NP problem, the study undertaken in this proposal is of central intellectual relevance to complexity theory as well as several other areas of science and engineering. Furthermore, since GCT reveals a deep connection between the P vs. NP and related problems in complexity theory and fundamental positivity problems in pure mathematics, this study could lead to extensive collaboration between complexity theory and several branches mathematics, such as algebraic geometry and representation theory.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
AF: Small: Geometric Complexity Theory
  • 批准号:
    1716563
  • 项目类别:
    Standard Grant
  • 资助金额:
    $45.0万
  • 财政年份:
    2017
  • 负责人:
    Ketan Mulmuley
  • 依托单位:
Lower Bounds in Parallel Complexity
  • 批准号:
    9800042
  • 项目类别:
    Standard Grant
  • 资助金额:
    $21.7万
  • 财政年份:
    1998
  • 负责人:
    Ketan Mulmuley
  • 依托单位:
A Randomized Approach to Geometric Problems
  • 批准号:
    8906799
  • 项目类别:
    Standard Grant
  • 资助金额:
    $9.84万
  • 财政年份:
    1989
  • 负责人:
    Ketan Mulmuley
  • 依托单位:
国内基金
海外基金
昼夜节律性small RNA在血斑形成时间推断中的法医学应用研究
  • 批准号:
  • 项目类别:
    省市级项目
  • 资助金额:
    --
  • 批准年份:
    2024
  • 负责人:
  • 依托单位:
tRNA-derived small RNA上调YBX1/CCL5通路参与硼替佐米诱导慢性疼痛的机制研究
  • 批准号:
  • 项目类别:
    省市级项目
  • 资助金额:
    10.0万元
  • 批准年份:
    2022
  • 负责人:
    张祥忠
  • 依托单位:
Small RNA调控I-F型CRISPR-Cas适应性免疫性的应答及分子机制
Small RNAs调控解淀粉芽胞杆菌FZB42生防功能的机制研究
  • 批准号:
    31972324
  • 项目类别:
    面上项目
  • 资助金额:
    58.0万元
  • 批准年份:
    2019
  • 负责人:
    高学文
  • 依托单位: