课题基金 / 基金详情

AF: Large: Theory of Computation - Pushing the State-of-the-Art

AF: Large: Theory of Computation - Pushing the State-of-the-Art
AF:大:计算理论 - 推动最先进的技术
批准号:
1412958
负责人:
Avi Wigderson
金额:
$200.0万
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2014
资助国家:
美国
项目状态:
已结题
起止时间:
2014-09-01 至 2020-08-31

项目摘要

项目成果

Avi Wigderson的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
This project is aimed at understanding a variety of fundamental questions in the theory of computation. It will be carried out via the postdoctoral mentoring program at the Institute for Advanced Study, and as such the specific topics of focus will evolve with the postdocs present each year. Current foci include, among others, the following:- The power of formulas. Formulas is the most basic mathematical and computational descriptive mechanisms. Understanding their minimal length for natural problems captures at once limitation on the space requirements, as well as the potential parallelism inherent in the problem. The award will focus on the most challenging direction, which has so far resisted attack - proving limitation of formulas. More generally, the researchers will pursue proving limitations of other natural computational models, especially arithmetic computation.- The power of relaxationsThe "meta-algorithms": Linear and semi-definite relaxations of integer programs, are among the most fruitful and powerful techniques for solving (or finding approximate solutions) to optimization problems. The award will focus on understanding the limits of these techniques. This work ties in naturally to understanding the limitations of natural proof systems and of natural strategies for search algorithms.- Peeking inside the "black-box"One of the most useful paradigms in programming and learning is the encapsulation of objects as black-boxes, to which only input-output access is allowed. With this utility come limitations which can hopefully overcome if we are allowed some access into the internal workings of the black box. Modeling such access, in scientific experiments, machine learning and computational complexity is a challenge the researchers plan to pursue.Computational complexity, a foundational core of computer science, has proved itself a remarkably deep and fruitful fountain of problems, ideas and techniques over the past decades. The research agenda is expected to be a driver of innovation in Theoretical Computer Science and related disciplines. Some of the areas of study have potential implications outside theory, especially machine learning, coding theory, scientific discovery and more. On the educational side, the mentoring program furthers the quality of IAS postdocs to serve as outstanding teachers, graduate advisors and academic leaders and innovators in one of the most exciting branches of science today. Whether IAS alumni pursue a career in academia or industry their impact on technology and on the training of new generations undergraduate and graduate education is immense.
期刊论文(4)
专著(0)
科研奖励(0)
会议论文
Automating cutting planes is NP-hard
自动化切割平面是 NP 困难的
DOI: 10.1145/3357713.3384248
发表时间: 2020
期刊: STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
影响因子: --
作者: [Göös, M, Koroth, S, Mertz, I, Pitassi, T.]
通讯作者: Pitassi, T.
Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings
不变环生成元的代数复杂性、GCT 和硬度搜索问题
DOI: --
发表时间: 2020
期刊: Computational Complexity Conference (CCC
影响因子: --
作者: [Garg, A, Ikenmeyer, C, Makam, V, Oliveira, R, Walter, M, Wigderson, A.]
通讯作者: Wigderson, A.
AND testing and robust judgement aggregation
AND 测试和稳健的判断聚合
DOI: 10.1145/3357713.3384254
发表时间: 2020
期刊: STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
影响因子: --
作者: [Filmus, Y, Lifshitz, N, Minzer, D, Mossel, E.]
通讯作者: Mossel, E.
Geometric rank of tensors and subrank of matrix multiplication
张量的几何秩和矩阵乘法的子秩
DOI: --
发表时间: 2020
期刊: Electronic colloquium on computational complexity
影响因子: --
作者: [Kopparty, S, Moshkovitz, G, Zuiddam, J.]
通讯作者: Zuiddam, J.
AF: Medium: Theory of Computation - New Algorithmic and Hardness Techniques
  • 批准号:
    1900460
  • 项目类别:
    Continuing Grant
  • 资助金额:
    $120.0万
  • 财政年份:
    2019
  • 负责人:
    Avi Wigderson
  • 依托单位:
CDI Type II: Pseudorandomness
  • 批准号:
    0835373
  • 项目类别:
    Standard Grant
  • 资助金额:
    $175.0万
  • 财政年份:
    2008
  • 负责人:
    Avi Wigderson
  • 依托单位:
Lie Groups, Representations and Discrete Mathematics
  • 批准号:
    0542278
  • 项目类别:
    Standard Grant
  • 资助金额:
    $2.0万
  • 财政年份:
    2006
  • 负责人:
    Avi Wigderson
  • 依托单位:
ITR Medium Award: Computational Complexity Theory 2003
  • 批准号:
    0324906
  • 项目类别:
    Continuing Grant
  • 资助金额:
    $150.0万
  • 财政年份:
    2003
  • 负责人:
    Avi Wigderson
  • 依托单位:
国内基金
海外基金
基于水稻穗粒数关键基因LARGE2提高作物产量的探索与应用
  • 批准号:
  • 项目类别:
    省市级项目
  • 资助金额:
    --
  • 批准年份:
    2026
  • 负责人:
    黄洛将
  • 依托单位:
水稻穗粒数调控关键因子LARGE6的分子遗传网络解析
  • 批准号:
    --
  • 项目类别:
    青年科学基金项目
  • 资助金额:
    30万元
  • 批准年份:
    2022
  • 负责人:
    黄洛将
  • 依托单位:
量子自旋液体中拓扑拟粒子的性质:量子蒙特卡罗和新的large-N理论
  • 批准号:
    12074246
  • 项目类别:
    面上项目
  • 资助金额:
    62.0万元
  • 批准年份:
    2020
  • 负责人:
    Yoshitomo Kamiya
  • 依托单位:
甘蓝型油菜Large Grain基因调控粒重的分子机制研究
  • 批准号:
    31972875
  • 项目类别:
    面上项目
  • 资助金额:
    58.0万元
  • 批准年份:
    2019
  • 负责人:
    石江华
  • 依托单位: