课题基金 / 基金详情

Computational Complexity Theory and Circuit Complexity

Computational Complexity Theory and Circuit Complexity
计算复杂性理论和电路复杂性
批准号:
9204874
负责人:
Eric Allender
金额:
$21.69万
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
1992
资助国家:
美国
项目状态:
已结题
起止时间:
1992-08-01 至 1996-07-31

项目摘要

项目成果

Eric Allender的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
This research on problems in complexity theory, has several particular goals: (1) improved (non-)hierarchy theorems for probabilistic time complexity classes and related models of computation, (2) improved characterizations of arithmetic circuits in terms of Boolean circuits and related classes, (3) increased understanding of the relation between the complexity of the determinant and other complexity classes, and (4) increased understanding of small-depth circuit complexity classes, such as ACC and AC.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
AF: Small: Algebraic Methods in Codes and Computation
  • 批准号:
    1909683
  • 项目类别:
    Standard Grant
  • 资助金额:
    $30.0万
  • 财政年份:
    2019
  • 负责人:
    Eric Allender
  • 依托单位:
AF: Small: Computational Complexity Theory and Circuit Complexity
  • 批准号:
    1909216
  • 项目类别:
    Standard Grant
  • 资助金额:
    $20.0万
  • 财政年份:
    2019
  • 负责人:
    Eric Allender
  • 依托单位:
AF: Student Travel to Clay Mathematics Institute Complexity Workshop
  • 批准号:
    1809703
  • 项目类别:
    Standard Grant
  • 资助金额:
    $1.0万
  • 财政年份:
    2018
  • 负责人:
    Eric Allender
  • 依托单位:
EAGER: AF: New approaches to hardness for circuit minimization
  • 批准号:
    1555409
  • 项目类别:
    Standard Grant
  • 资助金额:
    $10.0万
  • 财政年份:
    2015
  • 负责人:
    Eric Allender
  • 依托单位:
海外基金