Advertisement

A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity

  • Andris Ambainis
  • Krišjānis Prūsis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8635)

Abstract

Sensitivity, certificate complexity and block sensitivity are widely used Boolean function complexity measures. A longstanding open problem, proposed by Nisan and Szegedy [7], is whether sensitivity and block sensitivity are polynomially related. Motivated by the constructions of functions which achieve the largest known separations, we study the relation between 1-certificate complexity and 0-sensitivity and 0-block sensitivity.

Previously the best known lower bound was \(C_1(f)\geq \frac{bs_0(f)}{2 s_0(f)}\), achieved by Kenyon and Kutin [6]. We improve this to \(C_1(f)\geq \frac{3 bs_0(f)}{2 s_0(f)}\). While this improvement is only by a constant factor, this is quite important, as it precludes achieving a superquadratic separation between bs(f) and s(f) by iterating functions which reach this bound. In addition, this bound is tight, as it matches the construction of Ambainis and Sun [3] up to an additive constant.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ambainis, A.: Polynomial degree vs. quantum query complexity. J. Comput. Syst. Sci. 72(2), 220–238 (2006)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Ambainis, A., Bavarian, M., Gao, Y., Mao, J., Sun, X., Zuo, S.: Tighter relations between sensitivity and other complexity measures. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 101–113. Springer, Heidelberg (2014)CrossRefGoogle Scholar
  3. 3.
    Ambainis, A., Sun, X.: New separation between s(f) and bs(f). CoRR, abs/1108.3494 (2011)Google Scholar
  4. 4.
    Buhrman, H., de Wolf, R.: Complexity measures and decision tree complexity: a survey. Theor. Comput. Sci. 288(1), 21–43 (2002)CrossRefzbMATHGoogle Scholar
  5. 5.
    Hatami, P., Kulkarni, R., Pankratov, D.: Variations on the Sensitivity Conjecture. Graduate Surveys, vol. 4. Theory of Computing Library (2011)Google Scholar
  6. 6.
    Kenyon, C., Kutin, S.: Sensitivity, block sensitivity, and l-block sensitivity of Boolean functions. Inf. Comput. 189(1), 43–53 (2004)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Nisan, N., Szegedy, M.: On the degree of Boolean functions as real polynomials. Computational Complexity 4, 301–313 (1994)CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    Rubinstein, D.: Sensitivity vs. block sensitivity of Boolean functions. Combinatorica 15(2), 297–299 (1995)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    Virza, M.: Sensitivity versus block sensitivity of Boolean functions. Inf. Process. Lett. 111(9), 433–435 (2011)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Andris Ambainis
    • 1
  • Krišjānis Prūsis
    • 1
  1. 1.Faculty of ComputingUniversity of LatviaRīgaLatvia

Personalised recommendations