Skip to main content
SpringerLink
Log in

Tight Bounds on Sensitivity and Block Sensitivity of Some Classes of Transitive Functions

  • Conference paper
  • First Online:
LATIN 2020: Theoretical Informatics (LATIN 2021)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 12118))

Included in the following conference series:

  • 578 Accesses

Abstract

Nisan and Szegedy [16] conjectured that block sensitivity is at most polynomial in sensitivity for any Boolean function. Until a recent breakthrough of Huang [14], the conjecture had been wide open in the general case, and was proved only for a few special classes of Boolean functions. Huang’s result [14] implies that block sensitivity is at most the 4th power of sensitivity for any Boolean function. It remains open if a tighter relationship between sensitivity and block sensitivity holds for arbitrary Boolean functions; the largest known gap between these measures is quadratic [3, 8, 9, 11, 18, 21].

We prove tighter bounds showing that block sensitivity is at most 3rd power, and in some cases at most square of sensitivity for subclasses of transitive functions, defined by various properties of their DNF (or CNF) representation. Our results improve and extend previous results regarding transitive functions. We obtain these results by proving tight (up to constant factors) lower bounds on the smallest possible sensitivity of functions in these classes.

In another line of research, it has also been examined what is the smallest possible block sensitivity of transitive functions. Our results yield tight (up to constant factors) lower bounds on the block sensitivity of the classes we consider.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Amano, K.: Minterm-transitive functions with asymptotically smallest block sensitivity. Inf. Process. Lett. 111(23–24), 1081–1084 (2011). https://doi.org/10.1016/j.ipl.2011.09.008

    Article  MathSciNet  MATH  Google Scholar 

  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). https://doi.org/10.1007/978-3-662-43948-7_9

    Chapter  MATH  Google Scholar 

  3. Ambainis, A., Sun, X.: New separation between s(f) and bs(f). Electron. Colloquium Comput. Complex. (ECCC) 18, 116 (2011). http://eccc.hpi-web.de/report/2011/116

  4. Ambainis, A., Vihrovs, J.: Size of sets with small sensitivity: a generalization of Simon’s Lemma. In: Jain, R., Jain, S., Stephan, F. (eds.) TAMC 2015. LNCS, vol. 9076, pp. 122–133. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-17142-5_12

    Chapter  MATH  Google Scholar 

  5. Arunachalam, S., Chakraborty, S., Koucký, M., Saurabh, N., de Wolf, R.: Improved bounds on Fourier entropy and Min-entropy. arXiv e-prints p. 1809.09819 (2018). http://arxiv.org/abs/1809.09819

  6. Bafna, M., Lokam, S.V., Tavenas, S., Velingker, A.: On the sensitivity conjecture for read-k formulas. In: Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 16:1–16:14 (2016). https://doi.org/10.4230/LIPIcs.MFCS.2016.16

  7. Buhrman, H., De Wolf, R.: Complexity measures and decision tree complexity: a survey. Theoret. Comput. Sci. 288(1), 21–43 (2002). https://doi.org/10.1016/S0304-3975(01)00144-X

    Article  MathSciNet  MATH  Google Scholar 

  8. Chakraborty, S.: On the sensitivity of cyclically-invariant Boolean functions. Discr. Math. Theor. Comput. Sci. 13(4), 51–60 (2011). http://dmtcs.episciences.org/552

  9. Chaubal, S., Gál, A.: New constructions with quadratic separation between sensitivity and block sensitivity. In: Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 13:1–13:16 (2018). https://doi.org/10.4230/LIPIcs.FSTTCS.2018.13

  10. Drucker, A.: Block Sensitivity of minterm-transitive functions. Theor. Comput. Sci. 412(41), 5796–5801 (2011). https://doi.org/10.1016/j.tcs.2011.06.025

    Article  MathSciNet  MATH  Google Scholar 

  11. Gopalan, P., Servedio, R.A., Tal, A., Wigderson, A.: Degree and sensitivity: tails of two distributions. arXiv e-prints p. 1604.07432 (2016), http://arxiv.org/abs/1604.07432

  12. Hatami, P., Kulkarni, R., Pankratov, D.: Variations on the sensitivity conjecture. Theory Comput. Graduate Surv. 4, 1–27 (2011). https://doi.org/10.4086/toc.gs.2011.004

    Article  Google Scholar 

  13. He, K., Li, Q., Sun, X.: A tighter relation between sensitivity complexity and certificate complexity. Theoret. Comput. Sci. 762, 1–12 (2019)

    Article  MathSciNet  Google Scholar 

  14. Huang, H.: Induced subgraphs of hypercubes and a proof of the sensitivity conjecture. arXiv e-prints arXiv:1907.00847, July 2019. https://arxiv.org/abs/1907.00847

  15. Kahn, J., Kalai, G., Linial, N.: The influence of variables on Boolean functions. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS), pp. 68–80 (1988). https://doi.org/10.1109/SFCS.1988.21923

  16. Nisan, N., Szegedy, M.: On the degree of Boolean functions as real polynomials. Comput. Complex. 4(4), 301–313 (1994). https://doi.org/10.1007/BF01263419

    Article  MathSciNet  MATH  Google Scholar 

  17. O’Donnell, R.: Analysis of Boolean functions. Cambridge University Press, Cambridge (2014)

    Book  Google Scholar 

  18. Rubinstein, D.: Sensitivity vs block sensitivity of Boolean functions. Combinatorica 15(2), 297–299 (1995). https://doi.org/10.1007/BF01200762

    Article  MathSciNet  MATH  Google Scholar 

  19. Simon, H.U.: A tight \(\Omega \)(loglog n)-bound on the time for parallel RAM’s to compute nondegenerated Boolean functions. Inf. Control 55(1), 102–107 (1982). https://doi.org/10.1016/S0019-9958(82)90477-6

    Article  Google Scholar 

  20. Sun, X.: Block sensitivity of weakly symmetric functions. In: Proceedings of the 3rd International Conference on Theory and Applications of Models of Computation (TAMC), pp. 339–344 (2006). https://doi.org/10.1007/11750321_32

  21. Virza, M.: Sensitivity versus block sensitivity of Boolean functions. Inf. Process. Lett. 111(9), 433–435 (2011). https://doi.org/10.1016/j.ipl.2011.02.001

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

We thank the anonymous referees for helpful comments.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Texas, Austin, TX, USA

    Siddhesh Chaubal & Anna Gál

Authors
  1. Siddhesh Chaubal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anna Gál
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Siddhesh Chaubal .

Editor information

Editors and Affiliations

  1. University of São Paulo, São Paulo, Brazil

    Yoshiharu Kohayakawa

  2. University of Campinas, Campinas, Brazil

    Flávio Keidi Miyazawa

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chaubal, S., Gál, A. (2020). Tight Bounds on Sensitivity and Block Sensitivity of Some Classes of Transitive Functions. In: Kohayakawa, Y., Miyazawa, F.K. (eds) LATIN 2020: Theoretical Informatics. LATIN 2021. Lecture Notes in Computer Science(), vol 12118. Springer, Cham. https://doi.org/10.1007/978-3-030-61792-9_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-61792-9_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-61791-2

  • Online ISBN: 978-3-030-61792-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation