Smooth Boolean Functions are Easy-Reference-Cited by-同舟云学术

Smooth Boolean Functions are Easy

Published:2016-01-14 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science
language:
Short-container-title:

Author:

Gopalan Parikshit¹,Nisan Noam²,Servedio Rocco A.³,Talwar Kunal⁴,Wigderson Avi⁵

Affiliation:

1. Microsoft Research, Redmond, WA, USA

2. Microsoft Research and the Hebrew University, Jerusalem, Israel

3. Department of Computer Science, Columbia University, New York, NY, USA

4. Google Research, Mountain View, CA, USA

5. School of Mathematics, Institute for Advanced Study, Princeton, NJ, USA

Funder

National Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/2840728.2840738

Reference23 articles.

1. Combinatorial model and bounds for target set selection

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

3. Andris Ambainis Krisjanis Prusis and Jevgenijs Vihrovs. Sensitivity versus certificate complexity of boolean functions. CoRR abs/1503.07691 2015. Andris Ambainis Krisjanis Prusis and Jevgenijs Vihrovs. Sensitivity versus certificate complexity of boolean functions. CoRR abs/1503.07691 2015.

4. Andris Ambainis and Xiaoming Sun. New separation betweent $s(f)$ and $bs(f)$. CoRR abs/1108.3494 2011. Andris Ambainis and Xiaoming Sun. New separation betweent $s(f)$ and $bs(f)$. CoRR abs/1108.3494 2011.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Theoretical Limitations of Self-Attention in Neural Sequence Models;Transactions of the Association for Computational Linguistics;2020-12

2. Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture;Annals of Mathematics;2019-11-01

3. A tighter relation between sensitivity complexity and certificate complexity;Theoretical Computer Science;2019-03

4. On the Sensitivity Complexity of k-Uniform Hypergraph Properties;LEIBNIZ INT PR INFOR;2017

5. A Tighter Relation Between Sensitivity Complexity and Certificate Complexity;Lecture Notes in Computer Science;2017