( g, h ) satisfy it then for any n-argument monotone Boolean function f there is a close rela- tionship between the combinational and monotone network complexities of the function (f /\ g) \/ h. We characterise the class of pairs of functions satisfying the relationship and show that ...
monotone Boolean function Inference of monotone boolean functionsMonotone Boolean functionisotone Boolean function Inference of monotone boolean functionsIsotone Boolean functionantitone Boolean function Inference of monotone boolean functionsAntitone Boolean function...
1 1 Introduction The influence of a function, first introduced by Ben-Or and Linial [2] in the context of “collective coin- flipping”, captures the notion of the sensitivity of a multivariate function. More precisely, for a Boolean function f : {0, 1} n → {0, 1}, the...
Inference of Monotone Boolean Functions - Triantaphyllou, Torvik - 2001 () Citation Context ...function f is said to be a non-decreasing monotone (or isotone) Boolean function (or just monotone Boolean function for short) if and only if ∀x,x ′∈ {0, 1} n such that x ≼ x ...
functionsharmonic analysis learningmonotone Booleanmonotone circuitsSearching information retrieval systems is a highly interactive, iterative process that cannot be ... CL Borgman,SG Hirsh,J Hiller - 《Journal of the Association for Information Science & Technology》 被引量: 381发表: 1996年 Learning to...
Let f:{0,1}n→{0,1} be a monotone Boolean function of n variables:x⩾x′⇒f(x)⩾f(x′)foranyx,x′∈{0,1}n.Denote by(1.1)c=⋀I∈C⋁i∈Ixi,the irredundant conjunctive normal form (CNF) of f, where C is the set of the prime implicates I⊆{1,…,n} of f. ...
It is proven that the distribution of such functions is asymptotically normal if all monotone Boolean functions are equiprobable. The formulae are different depending on whether n is even or odd.关键词: asymptotic disjunctive normal form lower unit monotone Boolean function ...
We apply competitive analysis onto the problem of minimizing the number of queries to an oracle to completely reconstruct a given monotone Boolean function. Besides lower and upper bounds on the competitivity we determine optimal deterministic online algorithms for the smallest problem instances....
A criterion for testing whether a given monotone boolean function f is planar monotone computable from the sequence of inputs x1, x2,…, xn is developed in conjunction with an algorithm which (in principle) can construct a planar monotone circuit for f whenever one exists. Both the algorithm...
1) monotone boolean function 单调布尔函数 2) Boolean function 布尔函数 1. Application of probabilistic method to m th order Walsh spectra of Boolean functions; 概率方法在布尔函数m阶Walsh谱中的应用 2. Research of designing Boolean function based on swap sequence PSO; 基于交换序的粒子群算法...