PYI: A Study of Computational Complexity Theory

今天，理论计算机科学家面临的挑战与其说是获得更多具有有限长期意义的时髦结果，不如说是试图制定一个更连贯的框架和方法。为了迎接这一挑战，除组合数学外，更多的传统数学分支将发挥更重要的作用。这个项目将研究电路复杂性、合作博弈和交互证明系统，并开发新的证明技术和方法，希望获得一个更连贯的复杂性理论框架，并有助于我们对计算本质的理解。

A challenge facing theoretical computer scientists today is not so much to obtain more trendy results of limited long term significance, but rather, to try to formulate a more coherent framework and methodology. To meet this challenge more traditional branches of mathematics, in addition to combinatorics, will play a more significant role. This project will investigate circuit complexity, cooperative games and interactive proof systems and develop new proof techniques and methodologies in hopes to obtain a more coherent framework for complexity theory and contribute to our understanding of the nature of computation.