Computational Complexity Theory and Circuit Complexity

这项关于复杂性理论问题的研究有几个特别的目标：(1)改进的概率时间复杂性类和相关计算模型的(非)层次定理，(2)根据布尔电路和相关类来改进算术电路的特征，(3)增加了对行列式复杂性与其他复杂性类之间的关系的理解；(4)增加了对小深度电路复杂性类(如ACC和AC)的理解。

This research on problems in complexity theory, has several particular goals: (1) improved (non-)hierarchy theorems for probabilistic time complexity classes and related models of computation, (2) improved characterizations of arithmetic circuits in terms of Boolean circuits and related classes, (3) increased understanding of the relation between the complexity of the determinant and other complexity classes, and (4) increased understanding of small-depth circuit complexity classes, such as ACC and AC.