Boolean Function 431 浏览 0关注

In mathematics, a (finitary) Boolean function (or switching function) is a function (mathematics)|function of the form ƒ&nbsp;:&nbsp;Bk&nbsp;→&nbsp;B, where B&nbsp;=&nbsp;{0,&nbsp;1} is a Boolean domain and k is a non-negative integer called the arity of the function. In the case where k&nbsp;=&nbsp;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,&nbsp;…,&nbsp;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&nbsp;k.
 相关概念
 主要的会议/期刊 TC CORR DAC ECCC STOC TIT FOCS TCAD