一句话：将布尔电路可满足性推广到任意有限域上的多值电路，并揭示其复杂度与有限代数方程求解的紧密联系。
布尔电路可满足性一般 NP 完全，但限制到单调门或线性门时多项式可解。本文走出布尔域，研究由任意固定门集合在任意大有限域上构成的多值电路的可满足性。作者指出，从复杂度角度看，该问题与有限代数上方程（或方程组）的求解问题紧密相关。论文借助这一代数视角分析多值电路可满足性的复杂度，将布尔电路情形纳入更一般的有限域/有限代数框架，并探讨门集合的代数性质如何影响问题可解性与复杂度。其贡献在于建立多值电路 SAT 与有限代数方程求解之间的本质联系，并指出该联系是理解其复杂度的关键。
Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates. We go outside Boolean realm and consider circuits built of any fixed set of gates on an arbitrary large finite domain. From the complexity point of view this is strictly connected with the problems of solving equations (or systems of equations) over finite algebras.