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

Composition limits and separating examples for some boolean function complexity measures Autor Gilmer, Justin, Saks, Michael, Srinivasan, Srikanth

“…Block sensitivity ( bs ( f )), certificate complexity ( C ( f )) and fractional certificate complexity ( C *( f )) are three fundamental combinatorial measures…”
Získat plný text

Composition Limits and Separating Examples for Some Boolean Function Complexity Measures Autor Gilmer, Justin, Saks, Michael, Srinivasan, Srikanth

“…Block sensitivity (bs(f)), certificate complexity (C(f)) and fractional certificate complexity (C*(f)) are three fundamental combinatorial measures of…”
Získat plný text

Applicability of feed-forward and recurrent neural networks to Boolean function complexity modeling Autor Beg, Azam, Chandana Prasad, P.W., Beg, Ajmal

“…) models for predicting Boolean function complexity (BFC). In order to acquire the training data for the neural networks (NNs…”
Získat plný text

Polynomial-time Random Oracles, Nondeterministic Sublinear Time, and Boolean Function Complexity Autor Sekoni, Adewale

“…We use resource-bounded measure to study nondeterministic sublinear time, random oracles that separate complexity classes, and complexity measures of Boolean…”
Získat plný text

Discrete local central limit theorems and boolean function complexity measures Autor Gilmer, Justin

“…This thesis consists of 6 chapters (the first being an introduction). Two chapters relate to local central limit theorems, and three chapters relate to various boolean function complexity measures…”
Získat plný text

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

“… This paper compares different data processing strategies for NNs for prediction of Boolean function complexity (BFC). We compare NNs…”
Získat plný text

Harmonic analysis and Boolean function complexity Autor Bernasconi, A.

Získat plný text

Composition limits and separating examples for some Boolean function complexity measures Autor Gilmer, Justin, Saks, Michael, Srinivasan, Srikanth

“…Block sensitivity (\(bs(f)\)), certificate complexity (\(C(f)\)) and fractional certificate complexity (\(C^*(f)\)) are three fundamental combinatorial…”
Získat plný text

Combinatorial methods in Boolean function complexity Autor Gal, Anna

“…In this dissertation we explore a central theme of the theory of computing: the study of the inherent complexity of computational tasks via combinatorial…”
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

Lifting Dichotomies Autor Alekseev, Yaroslav, Filmus, Yuval, Smal, Alexander V.

“…Lifting theorems are used to transfer lower bounds between Boolean function complexity measures…”
Získat plný text

Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases Autor Karmakar, Pratik, Monet, Mikaël, Senellart, Pierre, Bressan, Stéphane

“…Shapley values, originating in game theory and increasingly prominent in explainable AI, have been proposed to assess the contribution of facts in query…”
Získat plný text

Certificate complexity of elementary symmetric Boolean functions Autor Zhang, Jing, Li, Yuan

“… Certificate complexity is an important combinatorial measure of Boolean function complexity…”
Získat plný text

Modelling the XOR/XNOR Boolean Functions Complexity Using Neural Network Autor Prasad, P.W.C., Singh, A.K., Beg, A., Assi, A.

“…This paper propose a model for the complexity of Boolean functions with only XOR/XNOR min-terms using back propagation neural networks (BPNNs) applied to…”
Získat plný text

Sensitivity, block sensitivity, and ℓ-block sensitivity of boolean functions Autor Kenyon, Claire, Kutin, Samuel

“…] and Nisan and Szegedy [Comput. Complexity 4(4) (1994) 301] have shown that block sensitivity is polynomially related to a number of measures of boolean function complexity…”
Získat plný text

On the CNF-complexity of bipartite graphs containing no squares Autor Katz, Nets Hawk

“… This negatively resolves Research Problem 1.33 of Jukna [S. Jukna, Boolean Function Complexity: Advances and Frontiers , Algorithms Comb., Vol…”
Získat plný text