Suchergebnisse - Boolean function complexity

On the multiplicative complexity of Boolean functions over the basis [formula omitted] von Boyar, Joan, Peralta, René, Pochuev, Denis

“… The multiplicative complexity c ∧(f) of a Boolean function f is the minimum number of AND gates in a circuit representing f which employs only AND, XOR and NOT gates …”
Volltext

Query complexity of Boolean functions on slices von Byramji, Farzan

“… We study the deterministic query complexity of Boolean functions on slices of the Boolean cube …”
Volltext

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

“… )) are three fundamental combinatorial measures of complexity of a boolean function f . It has long been known that bs ( f ) ≤ C *( f ) ≤ C ( f ) = O ( bs ( f ) 2 …”
Volltext

The complexity of Boolean functions in the Reed–Muller polynomials class von Suprun, V. P.

“… ). Two Shannon functions are introduced to estimate the complexity of Boolean functions in the polynomials class under consideration …”
Volltext

Query complexity of Boolean functions on the middle slice of the cube von Gerbner, Dániel, Keszegh, Balázs, Nagy, Dániel T., Nagy, Kartal, Pálvölgyi, Dömötör, Patkós, Balázs, Wiener, Gábor

“… We study the query complexity on slices of Boolean functions. Among other results we show that there exists a Boolean function for which we need to query …”
Volltext

Quantum query complexity of Boolean functions under indefinite causal order von Abbott, Alastair A., Mhalla, Mehdi, Pocreau, Pierre

“… In this paper, we approach this problem by studying the query complexity of Boolean functions under general higher-order quantum computations …”
Volltext

The Exact Circuit Complexity of Boolean Functions in an Infinite Basis von Kochergin, V. V., Mikhailovich, A. V.

“… The exact value of the complexity of the circuit implementation of an arbitrary Boolean function in a certain basis consisting of negation and all monotone Boolean functions is found …”
Volltext

Level-p-complexity of Boolean functions using thinning, memoization, and polynomials von JANSSON, JULIA, JANSSON, PATRIK

“… This paper describes a purely functional library for computing level-p-complexity of Boolean functions and applies it to two-level iterated majority …”
Volltext

Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order von Abbott, Alastair A., Mhalla, Mehdi, Pocreau, Pierre

Volltext

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

“… Certificate complexity is an important combinatorial measure of Boolean function complexity …”
Volltext

The multiplicative complexity of 6-variable Boolean functions von Çalık, Çağdaş, Sönmez Turan, Meltem, Peralta, René

“… The multiplicative complexity of a Boolean function is the minimum number of two-input AND gates that are necessary and sufficient to implement the function over the basis (AND, XOR …”
Volltext

On the relationship between energy complexity and other boolean function measures von Sun, Xiaoming, Sun, Yuan, Wu, Kewen, Xia, Zhiyu

“… We focus on energy complexity , a Boolean function measure related closely to Boolean circuit design …”
Volltext

Short Paper - The Binary Linearization Complexity of Pseudo-Boolean Functions von Walter, Matthias

“… We consider the problem of linearizing a pseudo-Boolean function f : { 0 , 1 } n → ℝ by means of k Boolean functions …”
Volltext

Exact Value of the Nonmonotone Complexity of Boolean Functions von Kochergin, V. V., Mikhailovich, A. V.

“… We study the complexity of the realization of Boolean functions by circuits in infinite complete bases containing all monotone functions with zero weight (cost of use …”
Volltext

On the Structure, Complexity, and Depth of the Circuits over the Basis {&, ∨} Realizing Step Boolean Functions von Lozhkin, S.A., Kinzhikeyeva, D.S.

“… The step Boolean function is a function of the algebra of logic of n Boolean variables, n = 1, 2 …”
Volltext

Asymptotics for the Complexity of Boolean Functions with Small Number of Ones von Red’kin, N. P.

“… The class of Boolean functions consisting of all functions of variables each of which outputs at exactly -tuples of values of the variables is considered …”
Volltext

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

“… )) are three fundamental combinatorial measures of complexity of a boolean function f. It has long been known that bs(f) ≤ C*f ≤ C(f) =O(bs(f) 2 …”
Volltext

Applicability of feed-forward and recurrent neural networks to Boolean function complexity modeling von 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 …”
Volltext

Boolean functions with multiplicative complexity 3 and 4 von Çalık, Çağdaş, Turan, Meltem Sönmez, Peralta, René

“… Multiplicative complexity (MC) is defined as the minimum number of AND gates required to implement a function with a circuit over the basis (AND, XOR …”
Volltext

On the parity complexity measures of Boolean functions von Zhang, Zhiqiang, Shi, Yaoyun

“… We prove that the deterministic parity decision tree complexity of any Boolean function is polynomially related to the non-deterministic complexity of the function or its complement …”
Volltext