Add to ORKGIt is shown that every Boolean function of n arguments has a circuit of depth n+1 over the basis {f|f:{0,1}^2 -> {0,1}}
We use Karchmer and Wigderson's recent characterization of circuit depth in terms of communicat...
This paper gives the first separation between the power of formulas and circuits of equal depth in ...
We prove a hierarchy theorem for the representation of monotone Boolean functions by monotone Boolea...
Two fundamental complexity measures for a Boolean function f are its circuit depth d(f) and its circ...
AbstractTwo fundamental complexity measures for a Boolean function f are its circuit depth d(f) and ...
textWe study the relationship between size and depth for Boolean circuits. Over four decades, very ...
We say that a circuit C over a field F {functionally} computes a polynomial P in F[x_1, x_2, ..., x_...
An important problem in theoretical computer science is to develop methods for estimating the comple...
We propose that multi-linear functions of relatively low degree over GF(2) may be good candidates fo...
A function of boolean arguments is symmetric if its value depends solely on the number of 1's among ...
A function of boolean arguments is symmetric if its value depends solely on the number of 1's among ...
Consider a family of boolean circuitsC1,C2,...,Cn,..., constructed by some uniform, effective proced...
Threshold weight, margin complexity, and Majority-of-Threshold circuit size are basic complexity mea...
AbstractA method for obtaining lower bounds on the contact circuit complexity of explicitly defined ...
Boolean network models have gained popularity in computational systems biology over the last dozen y...
We use Karchmer and Wigderson's recent characterization of circuit depth in terms of communicat...
This paper gives the first separation between the power of formulas and circuits of equal depth in ...
We prove a hierarchy theorem for the representation of monotone Boolean functions by monotone Boolea...
Two fundamental complexity measures for a Boolean function f are its circuit depth d(f) and its circ...
AbstractTwo fundamental complexity measures for a Boolean function f are its circuit depth d(f) and ...
textWe study the relationship between size and depth for Boolean circuits. Over four decades, very ...
We say that a circuit C over a field F {functionally} computes a polynomial P in F[x_1, x_2, ..., x_...
An important problem in theoretical computer science is to develop methods for estimating the comple...
We propose that multi-linear functions of relatively low degree over GF(2) may be good candidates fo...
A function of boolean arguments is symmetric if its value depends solely on the number of 1's among ...
A function of boolean arguments is symmetric if its value depends solely on the number of 1's among ...
Consider a family of boolean circuitsC1,C2,...,Cn,..., constructed by some uniform, effective proced...
Threshold weight, margin complexity, and Majority-of-Threshold circuit size are basic complexity mea...
AbstractA method for obtaining lower bounds on the contact circuit complexity of explicitly defined ...
Boolean network models have gained popularity in computational systems biology over the last dozen y...
We use Karchmer and Wigderson's recent characterization of circuit depth in terms of communicat...
This paper gives the first separation between the power of formulas and circuits of equal depth in ...
We prove a hierarchy theorem for the representation of monotone Boolean functions by monotone Boolea...