Advertisement

Block Sensitivity of Weakly Symmetric Functions

  • Xiaoming Sun
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3959)

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).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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 1998zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Buhrman, H., de Wolf, R.: Complexity measures and decision tree complexity: a survey. Theoretical Computer Science 288(1), 21–43 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Chakraborty, S.: On the Sensitivity of Cyclically-Invariant Boolean Functions. In: IEEE Conference on Computational Complexity, pp. 163–167 (2005)Google Scholar
  4. 4.
    Lovasz, L., Young, N.: Lecture notes on evasiveness of graph properties, Technical Report TR 317-91, Princeton University (1994)Google Scholar
  5. 5.
    Nisan, N.: CREW PRAMs and Decision Trees. SIAM Journal on Computing 20(6), 999–1007 (1991); Earlier version in STOC 1989zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Nisan, N., Szegedy, M.: On the Degree of Boolean Functions as Real Polynomials. Computational Complexity 4(4), 301–313 (1994); Earlier version in STOC 1992zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Rivest, R., Vuillemin, J.: On recognizing graph properties from adjacency matrices. Theoretical Computer Science 3, 371–384 (1976)CrossRefMathSciNetGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Turán, G.: The Critical Complexity of Graph Properties. Information Processing Letters 18(3), 151–153 (1984)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Xiaoming Sun
    • 1
  1. 1.Center for Advanced StudyTsinghua University 

Personalised recommendations