Boolean function

常见例句

Keeping the Boolean functions true() and false() as Booleans without having them unintentionally converted to strings is difficult.
保持 Boolean 函數 true() 和 false() 爲 Booleans 值，不讓它們被意外地轉換成字符串，是很睏難的。
As a result, we provide a new recursive construction method which can construct m-resilient Boolean functions of n variables with high nonlinearity and algebraic degree nm-1.
由於本文搆造方法中可供選擇的變換個數很多，所以與原搆造方法相比，可以得到更多的彈性函數。
This paper gives the way and flow chart for improvement of the algorithm. The improved algorithm will reduce computation and be available for minimization of the standard Boolean functions.
本文給出的改進方法可以減少計算量，有利於標準型佈爾函數的極小化。