Lower bounds on the complexity of 1-time only branching programs (Preliminary version)-Reference-Cited by-同舟云学术

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

Lower bounds on the complexity of 1-time only branching programs (Preliminary version)

Published: Issue: Volume: Page:90-99
ISSN:
Container-title:Fundamentals of Computation Theory
language:
Short-container-title:

Author:

Dunne Paul. E.

Publisher

Springer-Verlag

Link

http://link.springer.com/content/pdf/10.1007/BFb0028795.pdf

Reference6 articles.

1. A.Borodin, D.Dolev, F.E.Fich, W.Paul. Bounds For Width-2 Branching Programs. Proceedings of 15th STOC, 1983, pp. 87–93.

2. A.Cobham. The Recognition Problem for the Set of Perfect Squares. 7th Symposium on SWAT, 1966, pp. 78–87.

3. W.Masek. A Fast Algorithm for the String Editing Problem and Decision Graph Complexity. Master Th., M.I.T.1976.

4. P.Pudlak. A Lower Bound on the Complexity Of Branching Programs. Univ. Of Prague, 1983.

5. I.Wegener. Optimal Decision Trees and 1-Time Only Branching Programs for Symmetric Boolean Functions. Proc. 9th CAAP, 1984.

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

1. Streaming and Query Once Space Complexity of Longest Increasing Subsequence;Lecture Notes in Computer Science;2023-12-09

2. A read-once lower bound and a (1,+k)-hierarchy for branching programs;Theoretical Computer Science;2000-05

3. Almost k-Wise Independence and Hard Boolean Functions;Lecture Notes in Computer Science;2000

4. On branching programs with bounded uncertainty;Automata, Languages and Programming;1998

5. On the hierarchy of nondeterministic branching k-programs;Fundamentals of Computation Theory;1997

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP