A Boolean function requiring 3n network size
Author:
Publisher
Elsevier BV
Subject
General Computer Science,Theoretical Computer Science
Reference6 articles.
1. A 2.75n-lower bound on the network complexity of boolean functions;Blum,1981
2. A 2.5n-lower bound on the combinational complexity of boolean functions;Paul;SIAM J. Comput.,1977
3. Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen;Schnorr;Computing,1974
4. A 3n-lower bound on the network complexity of boolean functions;Schnorr;Theoret. Comput. Sci.,1980
5. On the combinational complexity of certain symmetric Boolean functions;Stockmeyer;Math. Systems Theory,1977
Cited by 76 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Improving $$3N$$ Circuit Complexity Lower Bounds;computational complexity;2023-12
2. Hay from the Haystack: Explicit Examples of Exponential Quantum Circuit Complexity;Communications in Mathematical Physics;2023-05-07
3. 3.1 n − o ( n ) circuit lower bounds for explicit functions;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
4. The exact complexity of pseudorandom functions and the black-box natural proof barrier for bootstrapping results in computational complexity;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
5. Is There an Oblivious RAM Lower Bound for Online Reads?;Journal of Cryptology;2021-05-11
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3