skip to main content
research-article

On the Sensitivity Complexity of k-Uniform Hypergraph Properties

Published:26 March 2021Publication History
Skip Abstract Section

Abstract

In this article, we investigate the sensitivity complexity of hypergraph properties. We present a k-uniform hypergraph property with sensitivity complexity O(n(⌈k/3⌉) for any k3, where n is the number of vertices. Moreover, we can do better when k1 (mod 3) by presenting a k-uniform hypergraph property with sensitivity O(n⌈k/3⌉-1/2). This result disproves a conjecture of Babai, which conjectures that the sensitivity complexity of k-uniform hypergraph properties is at least Ω (nk/2). We also investigate the sensitivity complexity of other symmetric functions and show that for many classes of transitive Boolean functions the minimum achievable sensitivity complexity can be O(N1/3), where N is the number of variables.

References

  1. Andris Ambainis and Xiaoming Sun. 2011. New separation between s(f) and bs(f). Electronic Colloquium on Computational Complexity 18 (2011), 116. http://eccc.hpi-web.de/report/2011/116.Google ScholarGoogle Scholar
  2. László Babai, Anandam Banerjee, Raghav Kulkarni, and Vipul Naik. 2010. Evasiveness and the distribution of prime numbers. In Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS’10). 71--82.Google ScholarGoogle Scholar
  3. Joshua Biderman, Kevin Cuddy, Ang Li, and Min Jae Song. 2015. On the sensitivity of k-uniform hypergraph properties. arXiv:1510.00354Google ScholarGoogle Scholar
  4. Timothy Black. 2015. Monotone properties of k-uniform hypergraphs are weakly evasive. In Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science (ITCS’15). ACM, New York, NY, 383--391. DOI:https://doi.org/10.1145/2688073.2688085Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Harry Buhrman and Ronald De Wolf. 2002. Complexity measures and decision tree complexity: A survey. Theoretical Computer Science 288, 1 (2002), 21--43.Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Amit Chakrabarti, Subhash Khot, and Yaoyun Shi. 2001. Evasiveness of subgraph containment and related properties. SIAM Journal on Computing 31, 3 (2001), 866--875. DOI:https://doi.org/10.1137/S0097539700382005Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Sourav Chakraborty. 2005. On the sensitivity of cyclically-invariant Boolean functions. In Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC’05). IEEE, Los Alamitos, CA, 163--167. DOI:https://doi.org/10.1109/CCC.2005.38Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Stephen Cook and Cynthia Dwork. 1982. Bounds on the time for parallel RAM’s to compute simple functions. In Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC’82). ACM, New York, NY, 231--233. DOI:https://doi.org/10.1145/800070.802196Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Stephen A. Cook, Cynthia Dwork, and Rüdiger Reischuk. 1986. Upper and lower time bounds for parallel random access machines without simultaneous writes. SIAM Journal on Computing 15, 1 (1986), 87--97. DOI:https://doi.org/10.1137/0215006Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Yihan Gao, Jieming Mao, Xiaoming Sun, and Song Zuo. 2013. On the sensitivity complexity of bipartite graph properties. Theoretical Computer Science 468 (2013), 83--91. DOI:https://doi.org/10.1016/j.tcs.2012.11.006Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Hao Huang. 2019. Induced subgraphs of hypercubes and a proof of the sensitivity conjecture. arXiv:1907.008487Google ScholarGoogle Scholar
  12. Raghav Kulkarni. 2013. Evasiveness through a circuit lens. In Proceedings of Innovations in Theoretical Computer Science (ITCS’13). 139--144.Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Raghav Kulkarni, Youming Qiao, and Xiaoming Sun. 2015. Any monotone property of 3-uniform hypergraphs is weakly evasive. Theoretical Computer Science 588 (2015), 16--23. DOI:https://doi.org/10.1016/j.tcs.2014.11.012Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Raghav Kulkarni and Avishay Tal. 2016. On fractional block sensitivity. Chicago Journal of Theoretical Computer Science 8 (2016), 1–16. http://cjtcs.cs.uchicago.edu/articles/2016/8/contents.html.Google ScholarGoogle ScholarCross RefCross Ref
  15. László Lovász and Neal E. Young. 2002. Lecture notes on evasiveness of graph properties. arXiV:cs/0205031Google ScholarGoogle Scholar
  16. Noam Nisan. 1991. CREW PRAMs and decision trees. SIAM Journal on Computing 20, 6 (1991), 999--1007.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Noam Nisan and Mario Szegedy. 1992. On the degree of Boolean functions as real polynomials. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing (STOC’92). ACM, New York, NY, 462--467. DOI:https://doi.org/10.1145/129712.129757Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Ronald L. Rivest and Jean Vuillemin. 1976. On recognizing graph properties from adjacency matrices. Theoretical Computer Science 3, 3 (1976), 371--384. DOI:https://doi.org/10.1016/0304-3975(76)90053-0Google ScholarGoogle ScholarCross RefCross Ref
  19. Xiaoming Sun. 2007. Block sensitivity of weakly symmetric functions. Theoretical Computer Science 384, 1 (2007), 87--91. DOI:https://doi.org/10.1016/j.tcs.2007.05.020Google ScholarGoogle ScholarCross RefCross Ref
  20. Xiaoming Sun. 2011. An improved lower bound on the sensitivity complexity of graph properties. Theoretical Computer Science 412, 29 (2011), 3524--3529.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Avishay Tal. 2013. Properties and applications of Boolean function composition. In Proceedings of Innovations in Theoretical Computer Science (ITCS’13). ACM, New York, NY, 441--454.Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. György Turán. 1984. The critical complexity of graph properties. Information Processing Letters 18, 3 (1984), 151--153.Google ScholarGoogle ScholarCross RefCross Ref
  23. Jake Wellens. 2020. Relationships between the number of inputs and other complexity measures of Boolean functions. arXiv:2005.00566Google ScholarGoogle Scholar

Index Terms

  1. On the Sensitivity Complexity of k-Uniform Hypergraph Properties

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format .

    View HTML Format
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!