课题基金 / 基金详情

Computational Complexity Theory and Circuit Complexity

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

项目摘要

项目成果

Eric Allender的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
The goals of this project include: (1) Continued investigation of complexity classes related to the computation of the determinant and the rank of integer matrices. Such classes include probabilistic logspace and the class #L of nondeterministic logspace counting problems(for circuits); (2) Continued exploration of resource-bounded measure, particularly as it can be applied to small complexity classes such as P.
期刊论文(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
  • 依托单位:
海外基金