Title of article :
On an infinite sequence of improving Boolean bases Original Research Article
Author/Authors :
D.U. Cherukhin، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Abstract :
We consider complexity of formulas for Boolean functions in finite complete bases. It is shown that, as regards complexity, the basis of all (k+1)-ary functions is essentially better than the basis of all k-ary functions for all k⩾2.
Keywords :
Boolean function , Complexity , Formula
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
