IPL
2006
13 years 4 months ago
2006
Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of ...
APPROX
2006
Springer
13 years 8 months ago
2006
Springer
We present a simple randomized construction of size O
STOC
1990
ACM
13 years 8 months ago
1990
ACM
We prove that monotone circuits computing the perfect matching function on n-vertex graphs require (n) depth. This implies an exponential gap between the depth of monotone and non...
COCO
2005
Springer
13 years 10 months ago
2005
Springer
Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of ...