Browsing Computer Science by Subject "Polynomial sign representation"
Now showing items 1-2 of 2
-
Combined weight and density bounds on the polynomial threshold function representation of Boolean functions
(Elsevier, 2022-08)In an earlier report it was shown that an arbitrary n-variable Boolean function f can be represented as a polynomial threshold function (PTF) with 0.75×2n or less number of monomials. In this report, we derive an upper ... -
On the co-absence of input terms in higher order neuron representation of boolean functions
(Springer International Publishin, 2017)Boolean functions (BFs) can be represented by using polynomial functions when −1 and +1 are used represent True and False respectively. The coefficients of the representing polynomial can be obtained by exact interpolation ...
Share this page