Boolean satisfiability problem 布尔可满足性问题 ; 问题SAT ; 布尔可满足问题
quantified Boolean formula problem 量化布尔公式问题
To emphasize the binary nature of this problem, it is frequently referred to as Boolean or propositional satisfiability.
强调二进制的性质这一问题，这是经常被称为布尔或命题满足。
The problem is that Boolean values have lost all their semantic meaning as soon as you construct them.
问题是，布尔值就已经失去了他们所有的语义结构。
Therefore constructions of Boolean permutation with high degree and high nonlinearity have become an important study problem.
因此构造出高次、非线性度高的布尔置换是一个重要的研究问题。
应用推荐