Mathematical Sciences: Combinatorics, Complexity and Convexity

数学科学：组合学、复杂性和凸性

• 批准号: 9013303
• 负责人: Victor Klee
• 金额: $ 9.76万
• 依托单位: University of Washington
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1991
• 资助国家: 美国
• 起止时间: 1991-03-15 至 1993-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9013303&HistoricalAwards=false
• 关键词: Mathematical; Sciences; Combinatorics; Complexity; Convexity

This award supports the research of Professor V. Klee to work in combinatorics, optimization, and computational geometry. He intends to work on higher dimensional computational geometry, the d-step conjecture in linear programming and qualitative analysis of linear systems. The research falls cross lines between the areas of combinatorics, optimization theory and computational geometry. Combinatorics attempts to find efficient methods to study how discrete collections of objects can be organized. And, so it is extremely important to modern communications. Optimization theory, first came to prominence in World War II, when the theory of linear programming was used so successfully. Computational geometry is fundamental to areas as diverse as CAD/CAM modelling and Robotics.

该奖项支持V. Klee教授的研究 在组合学、优化和计算领域工作， 几何 他打算研究更高维度的 计算几何，线性代数中的d步猜想 线性系统的定性分析和规划。 这项研究福尔斯跨越了以下领域： 组合数学、优化理论和计算 几何 组合数学试图找到有效的方法 来研究如何组织离散的对象集合。 因此，它对现代通信非常重要。 最优化理论，首先在世界上崭露头角， 第二次世界大战时，线性规划理论被用来 成功地 计算几何学是 CAD/CAM建模和机器人技术等领域。