Higher lower bounds on monotone size
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On the monotone circuit complexity of quadratic boolean functions
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Tight bounds for monotone switching networks via fourier analysis
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Hi-index | 0.00 |