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.