Boolean Function
431
浏览
0
关注

In mathematics, a (finitary) Boolean function (or switching function) is a function (mathematics)|function of the form ƒ : Bk → B, where B = {0, 1} is a Boolean domain and k is a non-negative integer called the arity of the function. In the case where k = 0, the function is essentially a constant element of B. Every k-ary Boolean function can be expressed as a propositional formula in k variables x1, …, x'k, and two propositional formulas are logical equivalence|logically equivalent if and only if they express the same Boolean function. There are 22k k-ary functions for every k.
主要的会议/期刊
演化趋势
Chart will load here
Boolean Function文章数量变化趋势

Feedback
Feedback
Feedback
我想反馈:
排行榜