Abstract
Block sensitivity, which was introduced by Nisan [5], is one of the most useful measures of boolean functions. In this paper we investigate the block sensitivity of weakly symmetric functions (functions invariant under some transitive group action). We prove a Ω(N 1/3) lower bound for the block sensitivity of weakly symmetric functions. We also construct a weakly symmetric function which has block sensitivity Õ(N 3/7).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. Journal of the ACM 48(4), 778–797 (2001); Earlier version in FOCS 1998
Buhrman, H., de Wolf, R.: Complexity measures and decision tree complexity: a survey. Theoretical Computer Science 288(1), 21–43 (2002)
Chakraborty, S.: On the Sensitivity of Cyclically-Invariant Boolean Functions. In: IEEE Conference on Computational Complexity, pp. 163–167 (2005)
Lovasz, L., Young, N.: Lecture notes on evasiveness of graph properties, Technical Report TR 317-91, Princeton University (1994)
Nisan, N.: CREW PRAMs and Decision Trees. SIAM Journal on Computing 20(6), 999–1007 (1991); Earlier version in STOC 1989
Nisan, N., Szegedy, M.: On the Degree of Boolean Functions as Real Polynomials. Computational Complexity 4(4), 301–313 (1994); Earlier version in STOC 1992
Rivest, R., Vuillemin, J.: On recognizing graph properties from adjacency matrices. Theoretical Computer Science 3, 371–384 (1976)
Sun, X., Yao, A.C.-C., Zhang, S.: Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go? In: IEEE Conference on Computational Complexity, pp. 286–293 (2004)
Turán, G.: The Critical Complexity of Graph Properties. Information Processing Letters 18(3), 151–153 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sun, X. (2006). Block Sensitivity of Weakly Symmetric Functions. In: Cai, JY., Cooper, S.B., Li, A. (eds) Theory and Applications of Models of Computation. TAMC 2006. Lecture Notes in Computer Science, vol 3959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11750321_32
Download citation
DOI: https://doi.org/10.1007/11750321_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34021-8
Online ISBN: 978-3-540-34022-5
eBook Packages: Computer ScienceComputer Science (R0)