Lower bounds to the complexity of symmetric Boolean functions-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Lower bounds to the complexity of symmetric Boolean functions

Published:1990-08 Issue:3 Volume:74 Page:313-323
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Babai L.,Pudlák P.,Rödl V.,Szemeredi E.

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference8 articles.

1. Two lower bounds for branching programs;Ajtai;Proc. 18th ACM STOC,1986

2. Ramsey theory and lower bounds for branching programs;Alon;Proc. 27th FOCS,1986

3. Ω(n log n) lower bounds on the length of Boolean formulas;Fischer;SIAM J. Comput.,1982

4. On the problem of realization of symmetric Boolean functions by contact schemes;Lupanov;Probl. Kibernet.,1965

5. On a Boolean function;Nečiporuk;Dokl. Akad. Nauk. SSSR,1966

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

1. Catalytic Branching Programs from Groups and General Protocols;ACM Transactions on Computation Theory;2023-12-12

2. Sensitivity metrics of complex network based on co-occurrence truth table: exemplified by a high-speed rail network;Journal of Geographical Systems;2023-06-19

3. A lower bound on the monotone switching complexity of the threshold function $T_n^{n-1}$;Diskretnaya Matematika;2023

4. Note on the three-coloured bipartite Ramsey numbers for paths;International Journal of Computer Mathematics: Computer Systems Theory;2021-06-14

5. Letting Alice and Bob choose which problem to solve: Implications to the study of cellular automata;Theoretical Computer Science;2013-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3