On the bottleneck counting argument

Authors:
Janos Simon;Shi-Chun Tsai
Affiliations:
Univ. of Chicago, Chicago, IL;National Chi-Nan Univ., Pu-Li, Taiwan
Venue:
Theoretical Computer Science
Year:
2000

Citing 0
Cited 2

On the monotone circuit complexity of quadratic boolean functions

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Strong ETH holds for regular resolution

Proceedings of the forty-fifth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	5.23

Visualization

Abstract