Computational complexity of geometric and combinatorial problems

几何和组合问题的计算复杂性

• 批准号: 3583-2009
• 负责人: Kirkpatrick, David
• 金额: $ 3.64万
• 依托单位: University of British Columbia
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2012
• 资助国家: 加拿大
• 起止时间: 2012-01-01 至 2013-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=513141
• 关键词: Computational; complexity; geometric; combinatorial; problems

The objective of the proposed research is to further our understanding of the inherent computational complexity of a number of fundamental combinatorial and geometric problems. Our main goal is to provide answers to two complementary questions: (i) "In what ways and to what extent do certain structural features (attributes of specific problem instances) contribute to the difficulty of solving problems in a particular family?" and (ii) "In what ways and to what extent can certain naturally occurring features or constraints be exploited to provide more efficient solutions for problem instances that exhibit these features?"

所提出的研究的目的是进一步了解一些基本的组合和几何问题的固有的计算复杂性。我们的主要目标是提供两个互补的问题的答案：（一）“在什么方式和在什么程度上做某些结构特征（属性的具体问题实例）有助于解决问题的困难，在一个特定的家庭？“和（ii）“以何种方式和在何种程度上可以利用某些自然发生的特征或限制，为表现出这些特征的问题实例提供更有效的解决方案？"