Results 11 to 20 of about 5,235,728 (202)

Ceilings of Monotone Boolean Functions

J. Univers. Comput. Sci., 1996
JUCS - Journal of Universal Computer Science Volume Nr.
Dunne,Paul, Dunne, Paul
openaire   +5 more sources

On the planar monotone computation of boolean functions [PDF]

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

Influences of monotone Boolean functions [PDF]

Discrete Mathematics, 2010
Recently, Keller and Pilpel conjectured that the influence of a monotone Boolean function does not decrease if we apply to it an invertible linear transformation. Our aim in this short note is to prove this conjecture.
Christofides, Demetres
openaire   +3 more sources

Cryptographic properties of monotone Boolean functions [PDF]

Journal of Mathematical Cryptology, 2016
Abstract We prove various results on monotone Boolean functions. In particular, we prove a conjecture proposed recently, stating that there are no monotone bent Boolean functions. Further, we give an upper bound on the nonlinearity of monotone functions in odd dimension, we describe the Walsh–Hadamard spectrum and investigate some ...
Carlet, Claude, Joyner, David, Stănică, Pantelimon, Tang, Deng   +3 more
core   +7 more sources

On Learning Monotone Boolean Functions under the Uniform Distribution [PDF]

Theoretical Computer Science, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kazuyuki Amano, Akira Maruoka
openaire   +2 more sources

Query rewriting over shallow ontologies [PDF]

, 2013
We investigate the size of rewritings of conjunctive queries over OWL2QL ontologies of depth 1 and 2 by means of a new hypergraph formalism for computing Boolean functions. Both positive and negative results are obtained.
Kikot, Stanislav, Podolskii, V., Zakharyaschev, Michael, Kontchakov, Roman   +3 more
core   +7 more sources

Exponential lower bounds and separation for query rewriting [PDF]

, 2012
We establish connections between the size of circuits and formulas computing monotone Boolean functions and the size of first-order and nonrecursive Datalog rewritings for conjunctive queries over OWL 2 QL ontologies.
S. Kikot, Vladimir Podolskii, R. Kontchakov, Kikot, Stanislav, Roman Kontchakov, Podolskii, V., Michael Zakharyaschev, V. Podolskii, Zakharyaschev, Michael, M. Zakharyaschev, Stanislav Kikot, Kontchakov, Roman   +11 more
core   +1 more source

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