Lower bounds for deterministic and nondeterministic branching programs
Author:
Publisher
Springer Berlin Heidelberg
Link
http://link.springer.com/content/pdf/10.1007/3-540-54458-5_49.pdf
Reference45 articles.
1. M. Ajtai, L. Babai, P. Hajnal, J. Komlos, P. Pudlák, V. Rödl, E. Szemeredi, and Gy. Turán. Two lower bounds for branching programs. In Proceedings of the 18st ACM STOC, pages 30–38, 1986.
2. M. Ajtai, J. Komlós, and E. Szemeredi. An O(n log n) sorting network. In Proceedings of the 15st ACM STOC, pages 1–9, 1983.
3. R. Aleluinas, R. M. Karp, R. J. Lipton, R. J. Lovász, and C. Rackoff. Random walks, universal sequences and the complexity of maze problems. In Proceedings of the 20th IEEE Symposium on Foundations of Computer Science, pages 218–223, 1979.
4. N. Alon and W. Maass. Meanders and their applications in lower bounds arguments. Journal of Computer and System Sciences, 37:118–129, 1988.
5. L. Babai, N. Nisan, and M. Szegedy. Multiparty protocols and logspace-hard pseudorandom sequences. In Proceedings of the 21st ACM STOC, pages 1–11, 1989.
Cited by 40 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Quantum advantage for computations with limited space;Nature Physics;2021-06-28
2. On Unordered BDDs and Quantified Boolean Formulas;Progress in Artificial Intelligence;2019
3. Selected challenges in computational lower bounds;ACM SIGACT News;2017-03-10
4. Monotone Projection Lower Bounds from Extended Formulation Lower Bounds;Theory of Computing;2017
5. Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method;ACM Transactions on Computation Theory;2016-12-26
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3