Generic complexity in computational topology: breaking through the bottlenecks

计算拓扑的通用复杂性：突破瓶颈

• 批准号: DP110101104
• 负责人: Prof Benjamin Burton
• 金额: $ 17.94万
• 依托单位: The University of Queensland
• 依托单位国家: 澳大利亚
• 项目类别: Discovery Projects
• 财政年份: 2011
• 资助国家: 澳大利亚
• 起止时间: 2011-01-01 至 2014-12-31
• 项目状态: 已结题
• 来源: https://dataportal.arc.gov.au/RGS/Web/Grants/DP110101104
• 关键词: Generic; complexity; computational; topology; breaking

The project will focus on key computational problems in three-dimensional topology, with the aims of illuminating the theoretical limitations of such problems, developing new computational tools for solving them, and applying these tools to a variety of applications. The project will generate theoretical research, practical software, and rich experimental data.

该项目将侧重于三维拓扑中的关键计算问题，旨在阐明此类问题的理论局限性，开发新的计算工具来解决这些问题，并将这些工具应用于各种应用。该项目将产生理论研究，实用软件和丰富的实验数据。