Upper and lower time bounds for parallel random access machines without simultaneous writes
SIAM Journal on Computing
On induced subgraphs of the cube
Journal of Combinatorial Theory Series A
SIAM Journal on Computing
The equivalence of two problems on the cube
Journal of Combinatorial Theory Series A
On the degree of Boolean functions as real polynomials
Computational Complexity - Special issue on circuit complexity
Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
The critical complexity of all (monotone) Boolean functions and monotone graph properties
FCT '85 Fundamentals of Computation Theory
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Bounds on the time for parallel RAM's to compute simple functions
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Sensitivity, block sensitivity, and l-block sensitivity of boolean functions
Information and Computation
On the Sensitivity of Cyclically-Invariant Boolean Functions
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
On the sensitivity complexity of bipartite graph properties
Theoretical Computer Science
| Hi-index | 5.23 |
Turan (1984) [11] initiated the study of the sensitivity complexity of graph properties. He conjectured that for any non-trivial graph properties on n vertices, the sensitivity complexity is at least n-1. He proved an @?n4@? lower bound for sensitivity in his paper: Turan (1984) [11]. Wegener (1985) [12] proved this conjecture for all monotone graph properties. In this paper we improve Turan's lower bound to 617n(~0.35n). We hope that this will shed some light on the proof of Turan's conjecture.