Collaborative Research: Understanding, Coping with, and Benefiting From, Intractability

计算的难解性限制了理解自然和设计系统的能力。对于邮差、旅行推销员、地图涂色师和数百万其他想要尽可能高效地完成任务的人来说，难解性是一个绊脚石，但它是21世纪密码学的基础，而密码学反过来又是电子商务的支柱。为了理解、管理和利用难解性，必须在证明多种形式和计算模型的难解性，以及揭示不同形式和难解性使用之间的相互联系方面取得进展。这次探险将探索一系列不同但相互关联的计算难题，包括算法、复杂性、密码学、分析、几何、组合学和量子力学。首个“棘手中心”将设在普林斯顿。为了解决阻碍计算机科学重大进步的一些最深刻和最困难的理论问题，这次考察涉及到高度的学院互动，通过在地理上不同的参与机构之间的合作。外展活动包括一个活跃的“理论中的女性”项目，以及针对本科生和高中生的项目。

Computational intractability imposes a limit on the ability to understand nature and design systems. Intractability is a stumbling block for postmen, travelling salesmen, map colorers, and millions of others who would like to complete their tasks as efficiently as possible, yet it is the foundation of 21st century cryptography, which in turn is a pillar of electronic commerce. In order to understand, manage, and exploit intractability it is imperative that progress be made on proving intractability in many forms and computational models, and on unraveling the interconnections among different forms and uses of intractability. This Expedition will explore an array of diverse but interrelated topics in computational intractability including algorithms, complexity, cryptography, analysis, geometry, combinatorics, and quantum mechanics. A "Center for Intractability," the first of its kind, will be based at Princeton. Addressing some of the deepest and hardest theoretical problems standing in the way of significant advancements in computer science, this Expedition involves a high degree of collegial interactivity through collaborations among geographically local participating institutions. Outreach includes an active "Women in Theory" program as well as programs targeting undergraduate and high-school students.