Third Symposium on Complexity of Approximately Solved Problems

该奖项是对一个研讨会的部分支持， 解决问题 问题的解决近似于 因为我们不能精确地解决它们，或者因为我们选择不这样做。 在物理科学，工程学， 人工智能和我们无法解决的经济问题 因为信息（数据）是部分的， 污染了 然而，有时候，我们自己选择安顿下来 因为它的成本要低得多。 的 研讨会是由两个想法的交叉定义： 复杂性和近似解。 复杂性理论 近似解决的问题是一个研究下界的问题， 解决问题的内在困难，并寻求获得 最优信息和最优算法。 它研究这些 最坏情况、平均情况和概率问题 设置. 研讨会包括理论和应用。

This award is for partial support of a symposium on approximately solved problems. Problems are solved approximately either because we cannot solve them exactly ir because we choose not to. There are many problems in physical science, engineering, artificial intelligence, and economics that we cannot solve exactly because the information (data) is partial and contaminated. Sometimes, however, it is our own choice to settle for approximation because it is significantly cheaper. The symposium is defined by the intersection of two ideas: complexity and approximate solution. A complexity theory for approximately solved problems is one that studies lower bounds on the intrinsic difficulty of solving a problem and seeks to obtain optimal information and optimal algorithms. It studies these questions in worst case, average case, and probabilistic settings. The symposium includes both theory and applications.