AbstractWe show that every monotone formula that computes the threshold function THk, n, 2⩽k⩽n/2, has size at least ⌊k/2⌋nlog(n/(k−1)). The same lower bound is shown to hold in the stronger monotone directed contact networks model
AbstractWe prove an exponential lower bound for the majority function on constant depth monotone cir...
Using a notion of real communication complexity recently introduced by J. Krajcek, we prove a lower ...
We establish new separations between the power of monotone and general (non-monotone) Boolean circui...
AbstractWe show that every monotone formula that computes the threshold function THk, n, 2⩽k⩽n/2, ha...
We show that every monotone formula that computes the threshold function TH<SUB>k, n,</SUB> 2≤ , k≤n...
We show that every monotone formula that computes the threshold function THk, n, 2≤ , k≤n/2, has siz...
In this note we consider the problem of computing threshold functions using directed monotone contac...
The computation of threshold functions using formulas over the basis {AND, OR, NOT} is considered. I...
The computation of threshold functions using formulas over the basis {AND, OR, NOT} is considered. I...
AbstractWe show that any monotone linear threshold function on n Boolean variables can be approximat...
We consider the problem of computing threshold functions using directed and undirected monotone cont...
AbstractWe prove an exponential lower bound for the majority function on constant depth monotone cir...
AbstractWe construct a sequence of monotone Boolean functions hn :{0, 1}n→{0, 1}n, such that the mon...
We prove a hierarchy theorem for the representation of monotone Boolean functions by monotone Boolea...
AbstractWe prove a lower bound, exponential in the eighth root of the input length, on the size of m...
AbstractWe prove an exponential lower bound for the majority function on constant depth monotone cir...
Using a notion of real communication complexity recently introduced by J. Krajcek, we prove a lower ...
We establish new separations between the power of monotone and general (non-monotone) Boolean circui...
AbstractWe show that every monotone formula that computes the threshold function THk, n, 2⩽k⩽n/2, ha...
We show that every monotone formula that computes the threshold function TH<SUB>k, n,</SUB> 2≤ , k≤n...
We show that every monotone formula that computes the threshold function THk, n, 2≤ , k≤n/2, has siz...
In this note we consider the problem of computing threshold functions using directed monotone contac...
The computation of threshold functions using formulas over the basis {AND, OR, NOT} is considered. I...
The computation of threshold functions using formulas over the basis {AND, OR, NOT} is considered. I...
AbstractWe show that any monotone linear threshold function on n Boolean variables can be approximat...
We consider the problem of computing threshold functions using directed and undirected monotone cont...
AbstractWe prove an exponential lower bound for the majority function on constant depth monotone cir...
AbstractWe construct a sequence of monotone Boolean functions hn :{0, 1}n→{0, 1}n, such that the mon...
We prove a hierarchy theorem for the representation of monotone Boolean functions by monotone Boolea...
AbstractWe prove a lower bound, exponential in the eighth root of the input length, on the size of m...
AbstractWe prove an exponential lower bound for the majority function on constant depth monotone cir...
Using a notion of real communication complexity recently introduced by J. Krajcek, we prove a lower ...
We establish new separations between the power of monotone and general (non-monotone) Boolean circui...
DOI
Add to ORKG