U.S.-Netherlands Cooperative Research in Complexity Theory (Computer Science)
U.S.-Netherlands Cooperative Research in Complexity Theory (Computer Science)
批准号:
9123551
负责人:
Steven Homer
金额:
$1.25万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
1992
资助国家:
美国
项目状态:
已结题
起止时间:
1992-07-15 至 1995-12-31
中文摘要
该奖项支持三个美国 计算机科学家由教授协调 波士顿大学的史蒂文·霍默 彼得·货车·埃姆德·博阿斯教授和其他 数学与计算机系 阿姆斯特丹大学科学系 荷兰. 他们的研究将集中在 理论中的几个当前话题 计算,包括结构复杂性 Kolmogorov复杂性理论。 的 计划中的合作将加快, 双方举行了几次对等工作会议, 与会者将有机会 当地的年轻研究人员,特别是 研究生从参与中受益 在讨论中。 这项研究是在 数学和计算机科学。 的各种 七个国家之间的研究伙伴关系 参与者应在以下方面取得显著成果: 复杂性理论的几个核心领域。 的 美国提供的补充专业知识。 荷兰的参与者有可能 贡献见解和联系, 没有合作互动就不会出现。
英文摘要
This award supports a group of three U.S. computer scientists coordinated by Professor Steven Homer of Boston University to collaborate with Professor Peter van Emde Boas and others of the Department of Mathematics and Computer Science of the University of Amsterdam, the Netherlands. Their research will focus on several current topics in the theory of computation, including structural complexity theory and Kolmogorov complexity theory. The planned collaboration will be expedited by several reciprocal working meetings among the participants that will give opportunities to local young researchers and particularly graduate students to benefit from participation in the discussions. This research lies on the boundary between mathematics and computer science. The various research partnerships among the seven participants should yield significant results in several central areas of complexity theory. The complementary expertise contributed by the U.S. and Dutch participants has the potential to contribute insights and connections which would not emerge without the cooperative interactions.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
XPS: FULL: CCA: Collaborative Research: Automatically Scalable Computation
-
批准号:1533663
-
项目类别:Standard Grant
-
资助金额:$35.0万
-
财政年份:2015
-
负责人:Steven Homer
-
依托单位:
Quantum Computation and Complexity Theory
-
批准号:9988310
-
项目类别:Continuing grant
-
资助金额:$22.95万
-
财政年份:2000
-
负责人:Steven Homer
-
依托单位:
The Structure of Complete Sets and Polynomial Reducibilities
-
批准号:9103055
-
项目类别:Standard Grant
-
资助金额:$0.0万
-
财政年份:1991
-
负责人:Steven Homer
-
依托单位:
Parallel Automated Reasoning and Clause-Graph Analysis
-
批准号:9003030
-
项目类别:Standard Grant
-
资助金额:$0.0万
-
财政年份:1990
-
负责人:Steven Homer
-
依托单位:
The Structure of Complete Sets And Honest Polynomial Reducibilities
-
批准号:8814339
-
项目类别:Standard Grant
-
资助金额:$0.0万
-
财政年份:1989
-
负责人:Steven Homer
-
依托单位:
Applications of Non-Linear Systems to Coding and Communications
-
批准号:8608137
-
项目类别:Standard Grant
-
资助金额:$0.0万
-
财政年份:1987
-
负责人:Steven Homer
-
依托单位:
Non-Linear Recurrence Relations, Quadratic Automata and Applications (Computer Research)
-
批准号:8202942
-
项目类别:Standard Grant
-
资助金额:$2.15万
-
财政年份:1982
-
负责人:Steven Homer
-
依托单位:
Non-Linear Recurrence Relations, Quadratic Automata and Applications (Computer Research)
-
批准号:8218383
-
项目类别:Standard Grant
-
资助金额:$0.0万
-
财政年份:1982
-
负责人:Steven Homer
-
依托单位:
海外基金