Výsledky vyhledávání - "boolean function complexity"

On the Sensitivity of Boolean and Multiple-Valued Symmetric Functions Autor Butler, Jon T., Sasao, Tsutomu

“…An n variable Boolean logic function f(\vec{x}) is sensitive to x_{i} if there is at least one assignment of values to \vec{x}-\{x_{i}\} such that f changes…”
Získat plný text

Investigating data preprocessing methods for circuit complexity models Autor Chandana Prasad, P.W., Beg, Azam

“…Preprocessing the data is an important step while creating neural network (NN) applications because this step usually has a significant effect on the…”
Získat plný text

Polynomial Representations of Symmetric Partial Boolean Functions Autor de Graaf, Mart, Valiant, Paul

“…For Boolean polynomials in $\mathbb{Z}_p$ of sufficiently low degree we derive a relation expressing their values on one level set in terms of their values on…”
Získat plný text

A lower bound on the mod 6 degree of the OR function Autor Tardos, G., Mix Barrington, D.A.

Získat plný text

Lower bounds on representing Boolean functions as polynomials in Zm Autor TSAI, S.-C

Získat plný text

On the complexity of Boolean functions computed by lazy oracles Autor Dunne, P.E., Leng, P.H., Nwana, G.F.

“…We introduce and examine some properties of a new complexity measure for Boolean functions. Unlike classical approaches, which are largely concerned with…”
Získat plný text