Add to ORKGAmonotone boolean function f: { 0,1} V → { 0,1} is read-once if f can be expressed as a boolean formula over (AND, OR, NOT) in which every variable in V appears at most once. V. Gurvich (and inde-pendently Karchmer, Linial, Newman, Saks, and Wigderson) proved anecessary and sufficient condition for f to be read-once. In this paper we show necessary and sufficient conditions for f to be read-once on a given subset of its inputs. For Z ⊆ V,wesay that f is read-once on Z if f can be expressed as a formula in which every member of Z appears at most once
AbstractSuppose we want to compute a Boolean function f, but instead of receiving the input, we only...
Efficient exact factoring algorithms are limited to read-once functions, in which each variable appe...
AbstractTC0 is the class functions computable by polynomial-size, constant-depth formulae with thres...
AbstractA monotone boolean function ƒ: {0,1}v → {0,1} is read-once if ƒ can be expressed as a boolea...
We give an alternative proof to a characterization theorem of Gurvich for Boolean functions whose fo...
AbstractWe give an alternative proof to a characterization theorem of Gurvich for Boolean functions ...
It is known that a positive Boolean function depending on variables has at least extremal points, ...
It is known that a positive Boolean function f depending on n variables has at least n + 1 extremal ...
A read-once formula is a boolean formula in which each variable occurs at most once. Such formulas a...
International audienceVarious combinatorial/algebraic parameters are used to quantify the complexity...
A fast polynomial-time algorithm was recently proposed to determine whether a logic function express...
In this paper we describe a new technique for exactly identifying certain classes of read-once Boole...
Let f be a de Morgan read-once function of n variables. Let f " be the random restriction obtai...
AbstractIf g is a monotone boolean function depending on all its variables, the property that each p...
Abstract. A certificate of non-membership for a Boolean function f with respect to a class C, f ̸ ∈ ...
AbstractSuppose we want to compute a Boolean function f, but instead of receiving the input, we only...
Efficient exact factoring algorithms are limited to read-once functions, in which each variable appe...
AbstractTC0 is the class functions computable by polynomial-size, constant-depth formulae with thres...
AbstractA monotone boolean function ƒ: {0,1}v → {0,1} is read-once if ƒ can be expressed as a boolea...
We give an alternative proof to a characterization theorem of Gurvich for Boolean functions whose fo...
AbstractWe give an alternative proof to a characterization theorem of Gurvich for Boolean functions ...
It is known that a positive Boolean function depending on variables has at least extremal points, ...
It is known that a positive Boolean function f depending on n variables has at least n + 1 extremal ...
A read-once formula is a boolean formula in which each variable occurs at most once. Such formulas a...
International audienceVarious combinatorial/algebraic parameters are used to quantify the complexity...
A fast polynomial-time algorithm was recently proposed to determine whether a logic function express...
In this paper we describe a new technique for exactly identifying certain classes of read-once Boole...
Let f be a de Morgan read-once function of n variables. Let f " be the random restriction obtai...
AbstractIf g is a monotone boolean function depending on all its variables, the property that each p...
Abstract. A certificate of non-membership for a Boolean function f with respect to a class C, f ̸ ∈ ...
AbstractSuppose we want to compute a Boolean function f, but instead of receiving the input, we only...
Efficient exact factoring algorithms are limited to read-once functions, in which each variable appe...
AbstractTC0 is the class functions computable by polynomial-size, constant-depth formulae with thres...