Search Results - "Boolean function complexity"

Composition limits and separating examples for some boolean function complexity measures by 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…”
Get full text

Composition Limits and Separating Examples for Some Boolean Function Complexity Measures by 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…”
Get full text

Applicability of feed-forward and recurrent neural networks to Boolean function complexity modeling by 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…”
Get full text

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

“…We use resource-bounded measure to study nondeterministic sublinear time, random oracles that separate complexity classes, and complexity measures of Boolean…”
Get full text

Discrete local central limit theorems and boolean function complexity measures by 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…”
Get full text

On the Sensitivity of Boolean and Multiple-Valued Symmetric Functions by 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…”
Get full text

Investigating data preprocessing methods for circuit complexity models by 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…”
Get full text

Harmonic analysis and Boolean function complexity by Bernasconi, A.

Get full text

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

“…Block sensitivity (\(bs(f)\)), certificate complexity (\(C(f)\)) and fractional certificate complexity (\(C^*(f)\)) are three fundamental combinatorial…”
Get full text

Combinatorial methods in Boolean function complexity by 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…”
Get full text

Polynomial Representations of Symmetric Partial Boolean Functions by 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…”
Get full text

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

Get full text

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

Get full text

On the complexity of Boolean functions computed by lazy oracles by 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…”
Get full text

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

“…Lifting theorems are used to transfer lower bounds between Boolean function complexity measures…”
Get full text

Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases by 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…”
Get full text

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

“… Certificate complexity is an important combinatorial measure of Boolean function complexity…”
Get full text

Modelling the XOR/XNOR Boolean Functions Complexity Using Neural Network by 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…”
Get full text

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

“… This negatively resolves Research Problem 1.33 of Jukna [S. Jukna, Boolean Function Complexity: Advances and Frontiers , Algorithms Comb., Vol…”
Get full text

On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication by Bryant, R.E.

“…Lower-bound results on Boolean-function complexity under two different models are discussed…”
Get full text