boolean function的意思

boolean function中文翻譯：

[數][計]布爾函數

相似詞語短語

boolean logic───n.<數>布爾邏輯；布林邏輯

function───n.功能；[數]函數；職責；盛大的集會；vi.運行；活動；行使職責

leveling function───調平功能

basic function───基本功能；[數]基本函數

clasper function───扣合器功能

function generator───信號（函數）發生器；信號[函數]發生器

nucleolus function───核仁函數

trigonometrical function───三角函數

urethra function───尿道功能

雙語使用場景

Resilient function is a natural generalization of correlation immunity Boolean function.───彈性函數是相關免疫布爾函數的自然推廣。

This fragment is evaluated as a string, even if its value was a Boolean function.───這個片段被判斷為字符串，即使它的值是Boolean函數。

In an XPath expression, comparing a string and a Boolean function can yield unexpected results.───在XPath表達式中，比較字符串和Boolean函數會得到非預期的結果。

A sufficient and necessary condition is given that the algebraic immunity of a Boolean function is not more than a fixed value.───借助覆蓋向量刻畫了代數免疫布爾函數的特征，給出布爾函數代數免疫不大于某確定值的充要條件。

After that the construction of resilient Boolean functions becomes an important direction of the research of Boolean function.───此后，彈性函數的構造一直是布爾函數研究中的一個重要工作。

Consider the unexpected result when a Boolean function is converted to a string and back again.───考慮Boolean函數轉換成字符串以及再轉換回來時會出現的非預期結果。

This paper presented a construction of Boolean function in odd variables with optimum algebraic immunity.───提出了遞歸構造奇數變元代數免疫最優布爾函數的一個方法。

It depicts the attack notion by using the low annihilators of a Boolean function to establish an equation group.───對利用布爾函數低次零化子建立低錯方程組實施攻擊的思想進行了闡述。

英語使用場景

A boolean function minimization system based on learning from examples called SWT is introduced in this paper.

The XMLEXISTS is a Boolean function that takes an XPath expression as input and returns FALSE if the XPath expression returns an empty sequence and TRUE otherwise.

Sentencedict.com is a sentence dictionary, on which you can find excellent sentences for a large number of words.

And more, the improved algorithm can be applied to constructing the low - degree Annihilators of Boolean function.

Boolean function reduction complete source code can be used directly.

BDD is a diagrammatic representation of Boolean function.

Based on the concept of correlation of annihilator, a new algorithm is proposed that allows to deciding whether a Boolean function has low degree annihilators successfully.

In minimizing a boolean function using the extraction method, the traditional steps are: getting the prime cover Z first; and then extracting the essential prime implicant from Z.

In some applications, we need to obtain the set of all satisfiable assignments of a Boolean function, in which assignments can not imply each other.