Results 11 to 20 of about 394 (158)

Sparse juntas on the biased hypercube [PDF]

TheoretiCS
We give a structure theorem for Boolean functions on the $p$-biased hypercube which are $\epsilon$-close to degree $d$ in $L_2$, showing that they are close to sparse juntas.
Irit Dinur, Yuval Filmus, Prahladh Harsha   +2 more
doaj   +1 more source

De Morgan Functions and Free De Morgan Algebras

Demonstratio Mathematica, 2014
It is commonly known that the free Boolean algebra on n free generators is isomorphic to the Boolean algebra of Boolean functions of n variables. The free bounded distributive lattice on n free generators is isomorphic to the bounded lattice of monotone ...
Movsisyan Yu. M., Aslanyan V. A., Manoogian Alex   +2 more
doaj   +1 more source

Representing polynomial of ST-CONNECTIVITY [PDF]

Discrete Mathematics & Theoretical Computer Science
We show that the coefficients of the representing polynomial of any monotone Boolean function are the values of the M\"obius function of an atomistic lattice related to this function.
Jānis Iraids, Juris Smotrovs
doaj   +1 more source

Mapping Monotone Boolean Functions into Majority [PDF]

IEEE Transactions on Computers, 2019
We consider the problem of decomposing monotone Boolean functions into majority-of-three operations, with a particular focus on decomposing the majority-$n$n function. When targeting monotone Boolean functions, Shannon’s expansion can be expressed by a single majority-of-three operation.
Eleonora Testa, Mathias Soeken, Luca Gaetano Amarù, Winston Haaswijk, Giovanni De Micheli   +4 more
openaire   +1 more source

Counting self-dual monotone Boolean functions [PDF]

Journal of Integer Sequences, 2023
Zaprezentowano kilka algorytmów zliczających samodualne monotoniczne funkcje boolowskie.
Bartłomiej Pawelski, Andrzej Szepietowski   +1 more
openaire   +2 more sources

Any Monotone Function Is Realized by Interlocked Polygons

Algorithms, 2012
Suppose there is a collection of n simple polygons in the plane, none of which overlap each other. The polygons are interlocked if no subset can be separated arbitrarily far from the rest.
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara   +2 more
doaj   +1 more source

On the planar monotone computation of boolean functions

Theoretical Computer Science, 1987
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meurig Beynon, John Buckle
openaire   +2 more sources

The monotone circuit complexity of boolean functions

Combinatorica, 1987
Some new results concerning lower bounds for the complexity of monotone circuits that detect cliques in graphs are obtained using modified versions of known methods. It is shown that even a very rough approximation of the maximum clique size of a graph, requires superpolynomial size of monotone circuits.
Noga Alon, Ravi B. Boppana
openaire   +2 more sources

Representations of Monotone Boolean Functions by Linear Programs [PDF]

ACM Transactions on Computation Theory, 2019
We introduce the notion of monotone linear programming circuits (MLP circuits), a model of computation for partial Boolean functions. Using this model, we prove the following results. 1 (1) MLP circuits are superpolynomially stronger than monotone Boolean circuits.
Mateus de Oliveira Oliveira, Pavel Pudlák   +1 more
openaire   +6 more sources

Monotone, Horn and Quadratic Pseudo-Boolean Functions [PDF]

J. Univers. Comput. Sci., 2000
JUCS - Journal of Universal Computer Science Volume Nr.
Foldes,Stephan, Hammer,Peter
openaire   +2 more sources